• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1995년도 추계학술대회발표논문집; 서울대학교, 서울; 30 Sep. 1995
• /
• pp.220-229
• /
• 1995

Generally the Multiprocessor Scheduling(MPS) problem is difficult to solve because of the precedence of the tasks, and it takes a lot of time to obtain its optimal solution. Though Genetic Algorithm(GA) does not guarantee the optimal solution, it is practical and effective to solve the MPS problem in a reasonable time. The algorithm developed in this research consists of a improved GA and CP/MISF(Critical Path/Most Immediate Successors First). A new genetic operator is derived to make GA more efficient. It runs parallel CP/MISF with Ga to complement the faults of GA. The solution by the developed algorithm is compared with that of CP/MISF, and the better is taken as a final solution. As a result of comparative analysis by using numerical examples, although this algorithm does not guarantee the optimal solution, it can obtain an approximate solution that is much closer to the optimal solution than the existing GA's.

• Journal of applied mathematics & informatics
• /
• 제15권1_2호
• /
• pp.227-235
• /
• 2004

In this paper we consider the dual problems for multiobjective programming with generalized convex functions. We obtain the weak duality and the strong duality. At last, we give an equivalent relationship between saddle point and efficient solution in multiobjective programming.

• 한국경영과학회지
• /
• 제20권1호
• /
• pp.147-158
• /
• 1995

In this paper a face optimization algorithm is developed for solving the problem (P) of optimizing a linear function over the set of efficient solution of a bicriterion linear program. We show that problem (P) can arise in a variety of practical situations. Since the efficient set is in general a nonoconvex set, problem (P) can be classified as a global optimization problem. The algorithm for solving problem (P) is guaranteed to find an exact optimal or almost exact optimal solution for the problem in a finite number of iterations. The algorithm can be easily implemented using only linear programming method.

• 대한수학회보
• /
• 제48권6호
• /
• pp.1225-1233
• /
• 2011

In this paper, without assumption of monotonicity, we study the compactness and the connectedness of the weakly efficient solutions set to vector equilibrium problems by using scalarization method in locally convex spaces. Our results improve the corresponding results in [X. H. Gong, Connectedness of the solution sets and scalarization for vector equilibrium problems, J. Optim. Theory Appl. 133 (2007), 151-161].

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 The Third Asian Fuzzy Systems Symposium
• /
• pp.506-511
• /
• 1998

In this paper we consider multiobjective linear programming problems with coefficients of the objective functions specified by possibility distributions. Possibly and necessarily efficient solution sets are defined as funny solution sets whose membership grades represent possibility and necessity degrees to which a feasible solution is efficient. Considering efficiency condition and its dual condition in ordinary multiobjective linear programming problem, we propose efficiency test methods based on an extreme ray generation method. Since the proposed methods can be put in the part of a bi-section method, we can develop calculation and methods of the degree of possible and necessary efficiency for feasible solutions.

• 대한교통학회지
• /
• 제6권2호
• /
• pp.7-20
• /
• 1988

Recent developments in combining transportation planning models and input-output approaches, together with inclusion of intensity of land uses, have made it possible to construct realistic comprehensive urban and regional activity models. These modes form the basis for a rigorous approach to studying the interactions among urban activities. However, efficient computational solution methods for implementing such comprehensive models are still not available. In this paper an efficient solution method for the urban activity model is developed by combining Evans' partial linearization technique with Powell's hybrid method. The solution algorithm is applied to a small but realistic urban area with a detailed transportation network.

• 한국철도학회:학술대회논문집
• /
• 한국철도학회 2006년도 추계학술대회 논문집
• /
• pp.616-623
• /
• 2006

As we have understood the commonly launched T-DMB service from December 2005, we kindly recommend to apply LCX cable installing solution which can be covering underground subway and tunnel T-DMB signal shadow area with most efficient network implementation method. Subway passengers would be enjoyable continuous T-DMB services through LCX cable installing solution.

• 품질경영학회지
• /
• 제5권1호
• /
• pp.23-29
• /
• 1977

Geometric programming is very useful for the solution of certain nonlinear programming problems in which the objective function and the constraints are posynomial expressions. By solving the dual program, it can be obtained that the solution of the primal program of Geometric programming. And, more efficient solution is to form an Augmented program possessing degree of difficult zero. A regional water-quality management problem may involve a multistage constrained optimization with many decision variables. In this problem, especially, appling that solution to it is also useful. This paper is described that : 1) the efficient solution of a water-quality management model formed by Geometric programming and 2) the algorithm developed to apply easily a real system by modifing and simplifing the solution.

• 한국세라믹학회지
• /
• 제56권6호
• /
• pp.589-595
• /
• 2019

The top-seeded solution growth (TSSG) method is an effective approach for the growth of high-quality SiC single crystals. In this method, the temperature gradient in the melt is the key factor determining the crystal growth rate and crystal quality. In this study, the effects of the aperture at the top of the hot-zone on the growth of the SiC single crystal obtained using the TSSG method were evaluated using multiphysics simulations. The temperature distribution and C concentration profile in the Si melt were taken into consideration. The simulation results showed that the adjustment of the aperture at the top of the hot-zone and the temperature gradient in the melt could be finely controlled. The surface morphology, crystal quality, and polytype stability of the grown SiC crystals were investigated using optical microscopy, high-resolution X-ray diffraction, and micro-Raman spectroscopy, respectively. The simulation and experimental results suggested that a small temperature gradient at the crystal-melt interface is suitable for growing high-quality SiC single crystals via the TSSG method.

• 한국전산구조공학회논문집
• /
• 제15권3호
• /
• pp.481-490
• /
• 2002

본 논문의 목적은 공간 트러스 비선형 해석기법에 대한 수치해석적 장단점을 비교하고, 효율적인 해석기법을 제안하는 것이다. 사용된 해석기법은 하중 제어법으로 뉴턴-랩슨법, 수정 뉴턴-랩슨법, 할선-뉴턴법, 하중-변위 제어법으로 호장법, 증분일 제어법, 그리고 본 논문에서 제안한 하중-변위의 복합적 제어법으로 복합 호장법 Ⅰ, 복합 호장법Ⅱ, 복합 증분일 제어법이 있다. 공간 트러스에 대한 해석기법의 효율성 평가를 위하여 해의 정확성, 수렴성, 계산시간 등을 제시된 예에 비교한 결과 본 논문에서 제안한 하중-변위의 복합적 제어법의 신뢰성을 입증하였으며, 기하학적 비선형 해석 및 좌굴후 거동의 추적에 있어서 효율적이었다. 특히, 자유도수가 많은 공간 트러스의 좌굴하중 추척에 있어서는 복합 증분일 제어법이 효율적이었다.