• Korean Management Science Review
• /
• v.15 no.1
• /
• pp.77-85
• /
• 1998

In this paper a face optimization algorithm is developed for solving the problem (P) of optimizing a linear function over the set of efficient solutions of a multiple objective linear program. Since the efficient set is in general a nonconvex set, problem (P) can be classified as a global optimization problem. Perhaps due to its inherent difficulty, relatively few attempts have been made to solve problem (P) in spite of the potential benefits which can be obtained by solving problem (P). 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.

• Journal of Korea Technology Innovation Society
• /
• v.8 no.1
• /
• pp.77-93
• /
• 2005

This study examines the efficient use of radio frequencies, which become one of the new economic resources, with civil and military cooperation. The current status of radio frequency resource and its future demands are predicted. Some problems and solutions regarding the civil and military usage of frequencies are suggested. Finally, economic, systematic and technical plans are presented for efficient use of frequencies.

• Korean Management Science Review
• /
• v.29 no.2
• /
• pp.143-155
• /
• 2012

The purpose of this study is to formulate and solve the scheduling problem to heat-treatment process in forging process and apply it to industries. Heat-treatment is a common process in manufacturing heavy forged products in ship engines and wind power generators. Total complete time of the schedule depends on how to group parts and assign them into heat furnace. Efficient operation of heat-treatment process increases the productivity of whole production system while scheduling the parts into heat-treatment furnace is a combinatorial problem which is known as an NP-hard problem. So the scheduling, on manufacturing site, relies on engineers' experience. To improve heat-treatment process schedule, this study formulated it into an MIP mathematical model which minimizes total complete time. Three methods were applied to example problems and the results were compared to each other. In case of small problems, optimal solutions were easily found. In case of big problems, feasible solutions were found and that feasible solutions were very close to lower bound of the solutions. ILOG OPL Studio 5.5 was used in this study.

• Structural Engineering and Mechanics
• /
• v.30 no.5
• /
• pp.593-602
• /
• 2008

This paper presents a new linearization algorithm to find the periodic solutions of the Duffing equation, under harmonic loads. Since the Duffing equation models a single degree of freedom system with a cubic nonlinear term in the restoring force, finding its periodic solutions using classical harmonic balance (HB) approach requires numerical integration. The algorithm developed in this paper replaces the integrals appearing in the classical HB method with triangular matrices that are evaluated algebraically. The computational cost of using increased number of frequency components in the matrixbased linearization approach is much smaller than its integration-based counterpart. The algorithm is computationally efficient; it only takes a few iterations within the region of convergence. An example comparing the results of the linearization algorithm with the "exact" solutions from a 4th order Runge- Kutta method are presented. The accuracy and speed of the algorithm is compared to the classical HB method, and the limitations of the algorithm are discussed.

• Journal of applied mathematics & informatics
• /
• v.28 no.3_4
• /
• pp.813-821
• /
• 2010

In this paper, the tenth-order linear boundary value problems are solved using reproducing kernel method. The algorithm developed approximates the solutions, and their higher-order derivatives, of differential equations and it avoids the complexity provided by other numerical approaches. First a new reproducing kernel space is constructed to solve this class of tenth-order linear boundary value problems; then the approximate solutions of such problems are given in the form of series using the present method. Three examples compared with those considered by Siddiqi, Twizell and Akram [S.S. Siddiqi, E.H. Twizell, Spline solutions of linear tenth order boundary value problems, Int. J. Comput. Math. 68 (1998) 345-362; S.S.Siddiqi, G.Akram, Solutions of tenth-order boundary value problems using eleventh degree spline, Applied Mathematics and Computation 185 (1)(2007) 115-127] show that the method developed in this paper is more efficient.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.40 no.12
• /
• pp.1211-1217
• /
• 1991

A three dimensional magnetostatic probodm is analyzed using the boundary element method and the magnetic scalar potential are employed in order to reduce the size of system matrix. Although the total magnetic scalar potential gives very accurate solutions at inner and outer regions of magnetic materal, the method has limitation on application because the magnetic scalar potential due to applied magnetic field sources is hard to be obtained. The reduced magnetic scalar potential gives more or less inaccurate solutions inside the magnetic material but very accurate solutions outside. Hence it can be concluded that the reduced magnetic scalar potential is very useful when the magnetic fields of outside of magnetic fields of outside of magnetic material are interested. It is also shown, from the numerical example, that the linear shape function gives more efficient solutions than the constant shape functions.

• Geomechanics and Engineering
• /
• v.25 no.4
• /
• pp.267-273
• /
• 2021

In this work, we compare the analytical solutions with the numerical solutions for photothermal interactions in semiconductor medium containing cylindrical cavity. This paper is devoted to a study of the photothermal interactions in semiconductor medium in the context of the coupled photo-thermal model. The basic equations are formulated in the domain of Laplace transform and the eigenvalue scheme are used to get the analytical solutions. The numerical solution is obtained by using the implicit finite difference method (IFDM). A comparison between the analytical solution and the numerical solutions are obtained. It is found that the implicit finite difference method (IFDM) is applicable, simple and efficient for such problems.

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.3
• /
• pp.409-428
• /
• 1995

Job shop scheduling with m different machines and n different jobs is a NP-hard problem of combinatorial optimization. The purpose of the paper is to develop the heuristic method using tabu search for job shop scheduling to minimize makespan or mean flowtime. To apply tabu search to job shop scheduling problem, in this paper we propose the several move methods that employ insert moves in order to generate the neighbor solutions, and present the efficient rescheduling procedure that yields active schedule for a changed operation sequence by a move of operations. We also discuss the tabu search techniques of diversifying the search of solution space as well as the simple tabu search. By experiments, we find the appropriate tabu list size and tabu attributes, and analyze the proposed tabu search techniques with respect to the quality of solutions and the efforts of computation. The experimental results show that the proposed tabu search techniques using long-term memory function have the ability to search a good solution, and are more efficient in the mean flowtime minimization problem than in the makespan minimization.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.7
• /
• pp.577-582
• /
• 2013

In this paper Legendre wavelets are used to approximate the solutions of linear time-invariant system. The Legendre wavelet and its integral operational matrix are presented and an efficient algorithm to solve the Sylvester matrix equation is proposed. The algorithm is based on the decomposition of the Sylvester matrix equation and the preorder traversal algorithm. Using the special structure of the Legendre wavelet's integral operational matrix, the full order Sylvester matrix equation can be solved in terms of the solutions of pure algebraic matrix equations, which reduce the computation time remarkably. Finally a numerical example is illustrated to demonstrate the validity of the proposed algorithm.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.453-454
• /
• 2008

Modern VLSI designs get increasingly complex and time-to-market constraints get tighter. Using high level languages is one of the most promising solutions for improving design productivity by raising the level of abstraction. In high level synthesis process, most important step is scheduling. In this paper, we propose fast and efficient scheduling method under timing constraint based on list scheduling. Experimental results on well known data path intensive designs show fast execution times (less than 0.5 sec) and similar results when compared to optimal solutions [1].