• Journal of the Korean Mathematical Society
• /
• v.44 no.4
• /
• pp.971-985
• /
• 2007

A sequential optimality condition characterizing the efficient solution without any constraint qualification for an abstract convex vector optimization problem is given in sequential forms using subdifferentials and ${\epsilon}$-subdifferentials. Another sequential condition involving only the subdifferentials, but at nearby points to the efficient solution for constraints, is also derived. Moreover, we present a proposition with a sufficient condition for an efficient solution to be properly efficient, which are a generalization of the well-known Isermann result for a linear vector optimization problem. An example is given to illustrate the significance of our main results. Also, we give an example showing that the proper efficiency may not imply certain closeness assumption.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.68 no.1
• /
• pp.159-166
• /
• 2019

Due to the various engagement situations, it is very difficult to generate the optimal trajectory with several constraints. This paper investigates the sequential convex programming for the impact angle control with the additional constraint of altitude limit. Recently, the SOCP(Second-Order Cone Programming), which is one area of the convex optimization, is widely used to solve variable optimal problems because it is robust to initial values, and resolves problems quickly and reliably. The trajectory optimization problem is reconstructed as convex optimization problem using appropriate linearization and discretization. Finally, simulation results are compared with analytic result and nonlinear optimization result for verification.

• Journal of Korean Society for Quality Management
• /
• v.18 no.2
• /
• pp.43-53
• /
• 1990

Mechanical components and structures are a major part of complex systems and the conseguences of their failure can be extremely costly. The ultimate goal of design engineers is to optimize these mechanical and structural design from the point of view of cost, reliability, weight, volume, maintainability and safety. An essential requirement of design optimization is to develop mathematical models for reliability at design stage. This paper is to minimize the cost of resources subject to the constraint that the reliability of the system must meet a specified level. The lagrange multiplier method is used to optimize the lognormal stress-lognormal strength problem. This optimization problem can be reduced to a search problem in one variable. A numerical example is presented to illustrate the optimization problem.

• Structural Engineering and Mechanics
• /
• v.35 no.1
• /
• pp.83-98
• /
• 2010

In this paper, the mass optimization of four bar linkages is carried out using genetic algorithms (GA) with single and dual constraints. The single constraint of bending stress and the dual constraints of bending and buckling stresses are imposed. From the movement response of the bar linkage mechanism, the analysis of the mechanism is developed using the combination of kinematics, kinetics, and finite element analysis (FEA). A penalty-based transformation technique is used to convert the constrained problem into an unconstrained one. Lastly, a detailed comparison on the effect of single constraint and of dual constraints is presented.

• Proceedings of the KSME Conference
• /
• 2000.04a
• /
• pp.725-730
• /
• 2000

Genetic algorithms based on the theory of natural selection, have been applied to many different fields, and have proven to be relatively robust means to search for global optimum and handle discontinuous or even discrete data. Genetic algorithms are widely used for unconstrained optimization problems. However, their application to constrained optimization problems remains unsettled. The most prevalent technique for coping with infeasible solutions is to penalize a population member for constraint violation. But, the weighting of a penalty for a particular problem constraint is usually determined in the heuristic way. Therefore this paper proposes, the effective technique for handling constraints, the ranking penalty method and hybrid genetic algorithms. And this paper proposes dynamic mutation tate to maintain the diversity in population. The effectiveness of the proposed algorithm is tested on several test problems and results are discussed.

• Proceedings of the KIEE Conference
• /
• 1999.07a
• /
• pp.253-255
• /
• 1999

In this paper, a shape optimization algorithm of superconducting magnet using finite element method is presented. Since the superconductor loses its superconductivity over the critical magnetic field and critical current density, this material property should be taken into account in the design process. Trial and error approach of repeating the change of the design variables costs much time and it sometimes does not guarantee an optimal design. This paper presents a systematic and efficient design algorithm for the superconducting magnet. We employ the sensitivity analysis based on finite element formulation. As for optimization algorithm, the inequality constraint for the superconducting state is removed by modifying the objective function and the nonlinear equality constraint of constant volume is satisfied by the gradient projection method. This design algorithm is applied to an optimal design problem of a solenoid air-cored superconducting magnet that has a design objective of the maximum energy storage.

• Structural Engineering and Mechanics
• /
• v.56 no.5
• /
• pp.707-726
• /
• 2015

There is a growing trend of considering uncertainty in optimization process since last few decades. In this regard, Robust Design Optimization (RDO) scheme has gained increasing momentum because of its virtue of improving performance of structure by minimizing the variation of performance and ensuring necessary safety and feasibility of constraint under uncertainty. In the present study, RDO of reinforced concrete folded plate and shell structure has been carried out incorporating uncertainty in the relevant parameters by Monte Carlo Simulation. Folded plate and shell structures are among the new generation popular structures often used in aesthetically appealing constructions. However, RDO study of such important structures is observed to be scarce. The optimization problem is formulated as cost minimization problem subjected to the force and displacements constraints considering dead, live and wind load. Then, the RDO is framed by simultaneously optimizing the expected value and the variation of the performance function using weighted sum approach. The robustness in constraint is ensured by adding suitable penalty term and through a target reliability index. The RDO problem is solved by Sequential Quadratic Programming. Subsequently, the results of the RDO are compared with conventional deterministic design approach. The parametric study implies that robust designs can be achieved by sacrificing only small increment in initial cost, but at the same time, considerable quality and guarantee of the structural behaviour can be ensured by the RDO solutions.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.31 no.4
• /
• pp.134-139
• /
• 2008

Most approaches for continuous review inventory problem need tables for loss function and cumulative standard normal distribution. Furthermore, it is time-consuming to calculate order quantity (Q) and reorder point (r) iteratively until required values are converged. The purpose of this paper is to develop a direct method to get the solution without any tables. We used approximation approaches for loss function and cumulative standard normal distribution. The proposed method can get the solution directly without any iterative procedure for Q, r and without any tables. The performance of the proposed approach is tested by using numerical examples. The budget constraint of this paper assumes that purchasing costs are paid at the time an order is arrived. This constraint can be easily replaced by capacity constraint or budget constraint in which' purchasing costs are paid at the time an order is placed.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.169.4-169
• /
• 2001

Conventional methods to solve the nonlinear programming problem range from augmented Lagrangian methods to sequential quadratic programming (SQP) methods. NPSOL, which is a SQP code, has been widely used to solve various optimization problems but is still subject to many numerical problems such as convergence to local optima, difficulties in initialization and in handling non-smooth cost functions. Recently, many evolutionary methods have been developed for constrained optimization. Among them, CEALM (Co-Evolutionary Augmented Lagrangian Method) shows excellent performance in the following aspects: global optimization capability, low sensitivity to the initial parameter guessing, and excellent constraint handling capability due to the benefit of the augmented Lagrangian function. This algorithm is ...

• Journal of Magnetics
• /
• v.19 no.4
• /
• pp.385-392
• /
• 2014

Uncertainties in loads, materials and manufacturing quality must be considered during electromagnetic devices design. This paper presents an effective methodology for robust optimization design based on the variance decomposition in order to keep higher accuracy of the robustness prediction. Sobol' theory is employed to estimate the response variance under some specific tolerance in design variables. Then, an optimal design is obtained by adding a criterion of response variance upon typical optimization problems as a constraint of the optimization. The main contribution of this paper is that the proposed method applies the variance decomposition to obtain a more accurate variance of the response, as well save the computational cost. The performance and robustness of the proposed algorithms are investigated through a numerical experiment with both an analytic function and the TEAM 22 problem.