• International Journal of Aeronautical and Space Sciences
• /
• v.12 no.3
• /
• pp.288-295
• /
• 2011

This paper addresses minimum-fuel, two-dimensional trajectory optimization for a soft lunar landing from a parking orbit to a desired landing site. The landing site is usually not considered when performing trajectory optimization so that the landing problem can be handled. However, for precise trajectories for landing at a desired site to be designed, the landing site has to be considered as the terminal constraint. To convert the trajectory optimization problem into a parameter optimization problem, a pseudospectral method was used, and C code for feasible sequential quadratic programming was used as a numerical solver. To check the reliability of the results obtained, a feasibility check was performed.

• YAKHAK HOEJI
• /
• v.18 no.1
• /
• pp.49-58
• /
• 1974

Tablet product design problem was structured as constrained optimization problem and subsequently solved by multiple regression analysis and Lagrangian method of optimization. Aluminum flufenamate was the drug chosen and microcrystalline cellulose nad starch were the binder and disintegrant, respectivley. The effect of the binder and disintegrant concentration on tablet hardness, friability, volume, in vitro release rate, and urinary excretion rate of drug in human subjects was recorded. Since a reasonably rapid release rate of drug is generally an important objective in the design of solid dosage form, optimization of this parameter was employed in studying the applicability of constrained optimization to a pharmaceutical product design problem. In addition to finding optimal sitivity analysis studies to such problems was also illustratd. It would appear that prediction of the in vivo t$_{50%}$ response from a knowledge of the incitro t$_{50%}$ response can be made fairly accurately for the tablet system used in this study.

• Bulletin of the Korean Mathematical Society
• /
• v.30 no.1
• /
• pp.1-7
• /
• 1993

Vector optimization problems consist of two or more objective functions and constraints. Optimization entails obtaining efficient solutions. Geoffrion [3] introduced the definition of the properly efficient solution in order to eliminate efficient solutions causing unbounded trade-offs between objective functions. In 1974, Isermann [7] obtained a necessary and sufficient condition for an efficient solution of a linear vector optimization problem with linear constraints and showed that every efficient solution is a properly efficient solution. Since then, many authors [1, 2, 4, 5, 6] have extended the Isermann's results. In particular, Gulati and Islam [4] derived a necessary and sufficient condition for an efficient solution of a linear vector optimization problem with nonlinear constraints, under certain assumptions. In this paper, we consider the following nonlinear vector optimization problem (NVOP): (Fig.) where for each i, f$_{i}$ is a differentiable function from R$^{n}$ into R and g is a differentiable function from R$^{n}$ into R$^{m}$ .

• Steel and Composite Structures
• /
• v.26 no.2
• /
• pp.163-170
• /
• 2018

The purpose of this paper is to present a new and efficient optimization algorithm called Jaya for optimum design of steel grillage structure. Constrained size optimization of this type of structure based on the LRFD-AISC is carried out with integer design variables by using cross-sectional area of W-shapes. The objective function of the problem is to find minimum weight of the grillage structure. The maximum stress ratio and the maximum displacement in the inner point of steel grillage structure are taken as the constraint for this optimization problem. To calculate the moment and shear force of the each member and calculate the joint displacement, the finite elements analysis is used. The developed computer program for the analysis and design of grillage structure and the optimization algorithm for Jaya are coded in MATLAB. The results obtained from this study are compared with the previous works for grillage structure. The results show that the Jaya algorithm presented in this study can be effectively used in the optimal design of grillage structures.

• Journal of applied mathematics & informatics
• /
• v.33 no.3_4
• /
• pp.387-399
• /
• 2015

In this paper, a new smoothing approximation to the l₁ exact penalty function for constrained optimization problems (COP) is presented. It is shown that an optimal solution to the smoothing penalty optimization problem is an approximate optimal solution to the original optimization problem. Based on the smoothing penalty function, an algorithm is presented to solve COP, with its convergence under some conditions proved. Numerical examples illustrate that this algorithm is efficient in solving COP.

• International Journal of Control, Automation, and Systems
• /
• v.5 no.2
• /
• pp.192-199
• /
• 2007

This paper proposes a new printed circuit board (PCB) assembly planning method for multi-head surface mounters. We present an integer programming formulation for the optimization problem, and propose a heuristic method to solve the large NP-complete problem within a reasonable time. A dynamic programming technique is then applied to the feeder arrangement optimization and placement sequence optimization to reduce the overall assembly time. Comparative simulation results are finally presented to verify the usefulness of the proposed method.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2000.10a
• /
• pp.443-448
• /
• 2000

In this paper, multiphase optimization of machine structure is presented. The goal of first step is to obtain (i) light weight, (ii) rigidity statically. In this step, multiple optimization problem with two objective functions is treated using Pareto Genetic Algorithm. Where two objective functions are weight of the structure, and static compliance. The method is applied to a new machine structure design.

• IE interfaces
• /
• v.20 no.4
• /
• pp.458-468
• /
• 2007

Artificial immune systems (AIS) are one of natural computing inspired by the natural immune system. The fault detection, the pattern recognition, the system control and the optimization are major application area of artificial immune systems. This paper gives a concept of artificial immune systems and useful techniques as like the clonal selection, the immune network theory and the negative selection. A concise survey on the optimization problem based on artificial immune systems is generated. The overall performance of artificial immune systems for the optimization problem is discussed.

• Management Science and Financial Engineering
• /
• v.12 no.1
• /
• pp.113-125
• /
• 2006

Bilevel programming problem is a two-stage optimization problem where the constraint region of the first level problem is implicitly determined by another optimization problem. In this paper we consider the bilevel quadratic/linear fractional programming problem in which the objective function of the first level is quasiconcave, the objective function of the second level is linear fractional and the feasible region is a convex polyhedron. Considering the relationship between feasible solutions to the problem and bases of the coefficient submatrix associated to variables of the second level, an enumerative algorithm is proposed which finds a global optimum to the problem.

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

Hypersonic civil airplanes are recently heated up again in USA and Japan, but there are several difficulties when we obtain its optimal trajectories. In this paper, we formulated the trajectory optimization problem as an optimal control problem and solved it by the direct shooting method with the Genetic Algorithm, GA. The result shows it is effective to use this method for the trajectory optimization of the hypersonic flight.