• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1999년도 추계학술대회 논문집 학회본부 A
• /
• pp.197-199
• /
• 1999

This paper deals with optimal power flow, which is optimal problem with equality constraint and inequality constraint. A algorithm of changing two constraints problem to one constraint - equality constraint problem - that make it analytical access for optimal power flow is presented.

• Structural Engineering and Mechanics
• /
• 제52권5호
• /
• pp.1051-1067
• /
• 2014

The structures of concern in this study are subject to two types of forces: dead loads from the acceleration imposed on the structures as well as the installed operation machines and the additional adjustable forces. We wish to determine the critical values of the adjustable forces when buckling of the structures occurs. The mathematical statement of such a problem gives rise to a constrained eigenvalue problem (CEVP) in which the dominant eigenvalue is subject to an equality constraint. A numerical algorithm for solving the CEVP is proposed in which an iterative method is employed to identify an interval embracing the target eigenvalue. The algorithm is applied to four engineering application examples finding the critical loads of a fixed-free beam subject to its own body force, two plane structures and one wide-flange beam using shell elements when acceleration force is present. The accuracy is demonstrated using the first example whose classical solution exists. The significance of the equality constraint in the EVP is shown by comparing the solutions without the constraint on the eigenvalue. Effectiveness and accuracy of the numerical algorithm are presented.

• 대한기계학회논문집A
• /
• 제29권12권
• /
• pp.1629-1637
• /
• 2005

Optimum sensitivity analysis (OSA) is the process to find the sensitivity of optimum solution with respect to the parameter in the optimization problem. The prevalent OSA methods calculate the optimum sensitivity as a post-processing. In this research, a simple technique is proposed to obtain optimum sensitivity as a result of the original optimization problem, provided that the optimum sensitivity of objective function is required. The parameters are considered as additional design variables in the original optimization problem. And then, it is endowed with equality constraints to penalize the additional variables. When the optimization problem is solved, the optimum sensitivity of objective function is simultaneously obtained as Lagrange multiplier. Several mathematical and engineering examples are solved to show the applicability and efficiency of the method compared to other OSA ones.

• Journal of Mechanical Science and Technology
• /
• 제14권6호
• /
• pp.655-665
• /
• 2000

We propose an efficient algorithm for the purpose of satisfying a wide range of design constraints represented with equality and inequality equations as well as production rules. The algorithm employs simulated-annealing and a production rule inference engine and works on design constraints represented with networks. The algorithm fulfills equality constraints through constraint satisfaction processes like variable elimination while taking into account inequality constraints and inferring production rules. It can also reduce the load of the optimization procedure if necessary. We demonstrate the implementation of the algorithm with the result on machine tool design.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2005년도 추계학술대회 논문집
• /
• pp.464-469
• /
• 2005

Optimum sensitivity analysis (OSA) is the process to find the sensitivity of optimum solution with respect to the parameter in the optimization problem. The prevalent OSA methods calculate the optimum sensitivity as a post-processing. In this research, a simple technique is proposed to obtain optimum sensitivity as a result of the original optimization problem, provided that the optimum sensitivity of objective function is required. The parameters are considered as additional design variables in the original optimization problem. And then, it is endowed with equality constraints to penalize the additional variables. When the optimization problem is solved, the optimum sensitivity of objective function is simultaneously obtained as Lagrange multiplier. Several mathematical and engineering examples are solved to show the applicability and efficiency of the method compared to other OSA ones.

• Journal of Electrical Engineering and Technology
• /
• 제13권3호
• /
• pp.1099-1109
• /
• 2018

For practical consideration, economic dispatch (ED) problems in power system have non-smooth cost functions with equality and inequality constraints that makes the problems complex constrained nonlinear optimization problems. This paper proposes a new constraint handling method for equality and inequality constraints which is employed to solve ED problems, where the incremental rate is employed to enhance the modification process. In order to prove the applicability of the proposed method, the study cases are tested based on the classical particle swarm optimization (PSO) and differential evolution (DE) algorithm. The proposed method is evaluated for ED problems using six different test systems: 6-, 15-, 20-, 38-, 110- and 140-generators system. Simulation results show that it can always find the satisfactory solutions while satisfying the constraints.

• 전기학회논문지
• /
• 제62권10호
• /
• pp.1349-1353
• /
• 2013

The optimal analysis has objective functions, equality constraint functions and inequality functions. Objective functions may be used with inequality function, because occasionally variables are moved to non-analytic condition with calculating objective functions. But inequality constraint functions are very complicated problem in a optimal analysis. this paper suggest a method to solve inequality constraint functions.

• International Journal of Control, Automation, and Systems
• /
• 제2권1호
• /
• pp.15-22
• /
• 2004

Some recent advances in stability and optimality for the nonlinear receding horizon control (NRHC) or the nonlinear model predictive control (NMPC) are assessed. The NRHCs with terminal conditions are surveyed in terms of a terminal state equality constraint, a terminal cost, and a terminal constraint set. Other NRHCs without terminal conditions are surveyed in terms of a control Lyapunov function (CLF) and cost monotonicity. Additional approaches such as output feedback, fuzzy, and neural network are introduced. This paper excludes the results for linear receding horizon controls and concentrates only on the analytical results of NRHCs, not including applications of NRHCs. Stability and optimality are focused on rather than robustness.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2000년도 학술대회 논문집 전문대학교육위원
• /
• pp.104-106
• /
• 2000

This paper presents an algorithm for optimal reactive power dispatch problem based on Improved Genetic Algorithm(IGA). Optimal Reactive Power Dispatch (ORPD) is particularized to the minimization of transmission line losses by suitable selection of generator reactive power outputs and transformer tap setting. For the objective, in this paper, Loss Re-Distribution Algorithm(LRDA) is new applied to the equality constraint of ORPD. The proposed method has been evaluated on the IEEE 30 bus system. Results of the application of the method are compared with a base case.

• 대한조선학회논문집
• /
• 제51권5호
• /
• pp.362-368
• /
• 2014

Container vessel sizes have constantly increased over the past two decades. With increasing ship sizes and higher container loading capacities, the adoption of lashing bridges has also increased. Today's lashing bridge designs range from 1st tier to 3rd tier lashing bridges. Container securing program of the past which is based on two lashing rods and 1st tier lashing bridge has to be improved to be suitable for the present time. The equilibrium equations in this study are established to cover the application of 3~4 lashing rods and 2nd~3rd tier lashing bridges. In addition developed program is improved to be able to calculate the reaction forces and optimum arrangement under the external lashing. An optimization algorithm which is suitable for the container securing problems involved the equality constraint has been also adopted in this study.