• Journal of the Korean Operations Research and Management Science Society
• /
• v.15 no.1
• /
• pp.73-82
• /
• 1990

This paper describes two algorithms to Nonlinear programming problems with equality constraints and with equality and inequality constraints. The first method treats nonlinear programming problems with equality constraints. Utilizing the nonlinear programming problems with equality constraints. Utilizing the nonlinear parametric programming technique, the method solves the problem by imbedding it into a suitable one-parameter family of problems. The second method is to solve a nonlinear programming problem with equality and inequality constraints, by minimizing a square sum of nonlinear functions which is derived from the Kuhn-Tucker condition.

• Journal of Mechanical Science and Technology
• /
• v.14 no.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.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.49 no.7
• /
• pp.339-344
• /
• 2000

This paper presents an improved optimal power flow algorithm, which solves an optimization problem with equality constraints with converted inequality constraints. The standard OPF and the penalty function method should do reconstructing active constraints among the inequality constraints so that the activation of the inequality constraints has been imposing an additional burden to solve OPF problem efficiently. However the proposed algorithm converts active inequality constraints into the equality constraints in order to preclude us from reconstructing the procedures. The effectiveness of the new OPF algorithm is validated by applying the IEEE 14 bus system.

• Proceedings of the KIEE Conference
• /
• 2000.07a
• /
• pp.7-9
• /
• 2000

This paper deals with optimal power flow, which is optimal problem with equality constraints and inequality constraints. An a1gorithm of changing inequality constraints problem to equality constraints problem is applied to real systems.

• Journal of the military operations research society of Korea
• /
• v.13 no.1
• /
• pp.91-100
• /
• 1987

This paper deals with an algorithm for solving nonlinear programming problems with equality constraints. Nonlinear programming problems are transformed into a square sums of nonlinear functions by the Lagrangian multiplier method. And an iteration method minimizing this square sums is suggested and then an algorithm is proposed. Also theoretical basis of the algorithm is presented.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.215-219
• /
• 2003

In this paper, we generate a trajectory minimized the energy gait of a biped robot for walking a staircase using genetic algorithms and apply to the computed torque controller for the stable dynamic biped locomotion. In the saggital plane, a 6 degree of freedom biped robot that model consists of seven links is used. In order to minimize the total energy efficiency, the Real-Coded Genetic Algorithm (RCGA) is used. Operators of genetic algorithms are composed of a reproduction, crossover and mutation. In order to approximate the walking gait, the each joint angle is defined as a 4-th order polynomial of which coefficients are chromosomes. Constraints are divided into equality and inequality. Firstly, equality constraints consist of position conditions at the end of stride period and each joint angle and angular velocity condition for periodic walking. On the other hand, inequality constraints include the knee joint conditions, the zero moment point conditions for the x-direction and the tip conditions of swing leg during the period of a stride for walking a staircase.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.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.

• Journal of the Korean Society for Railway
• /
• v.13 no.4
• /
• pp.419-424
• /
• 2010

Through the process of state estimation in the electric railway substation, this paper presents a new method for improving the reliability of the measurements corrupted by gauge error. Unlike the case of commercial power systems, it has been difficult to perform the state estimation by using the usual methods in the electric railway substation. At some of the monitoring points in the substation, most often, it is hard to define the measurement functions by use of the states or as we set up a new states set with the change of system topology, some of the measurement functions become part of the states themselves, which leads to poor results. To resolve the problems in the existing method caused by the relations between the states and the measurement functions at the monitoring points, the proposed method in this paper exploits the equality constraints. They can be derived numerously and concisely from the current and the voltage attributes of the Scott transformer and the buses connecting conditions, etc. We have proofed the effectiveness of the proposed method by the test on a standard sample substation.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10b
• /
• pp.486-490
• /
• 1993

In addtion to a basic motion task, redundant manipulators can achieve some additional tasks by optimizing proper performance criteria. Some of performance criteria can be transformed to inequality constraints. So the redundancy resolving problem can be reformulated as a local optimization problem with equality constraints for the end effector and inequality constraints for some performance criteria. In this article, we propose a method for solving the inverse kinematics of a manipulator with redundancy using the Kuhn-Tucker theorem to incorporate inequality constraints. With proper choice of inequality constraints, the proposed method gives a way of optimizing multiple criteria in redundant manipulators.

• Journal of Astronomy and Space Sciences
• /
• v.21 no.3
• /
• pp.209-220
• /
• 2004

Some methods have been presented to get optimal formation trajectories in the step of configuration or reconfiguration, which subject to constraints of collision avoidance and final configuration. In this study, a method for optimal formation trajectory-planning is introduced in view of fuel/time minimization using parameter optimization technique which has not been applied to optimal trajectory-planning for satellite formation flying. New constraints of nonlinear equality are derived for final configuration and constraints of nonlinear inequality are used for collision avoidance. The final configuration constraints are that three or more satellites should be placed in an equilateral polygon of the circular horizontal plane orbit. Several examples are given to get optimal trajectories based on the parameter optimization problem which subjects to constraints of collision avoidance and final configuration. They show that the introduced method for trajectory-planning is well suited to trajectory design problems of formation flying missions.