• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.50.2-50
• /
• 2001

Optimal control problems are notoriously difficult to solve either analytically or numerically except for limited cases of having simple dynamics. Evolutionary programming is a promising method of solving various optimal control problem arising in practice since it does not require the expression of Lagrange´s adjoint system and that it can easily implement the inequality constraints on the control variable, In this paper, evolutionary programming is combined with spline method, so the smoother control profile and the Jumping times could be obtained. The optimal profiles obtained by the proposed method are compared with exact solution if it is available. With more complicated model equation, the proposed method showed better performance than other researchers´. It is demonstrated that the evolutionary programming with spline method can ...

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1997년도 춘계학술대회 논문집
• /
• pp.589-594
• /
• 1997

We have already presented the constraint satisfaction algorithm which could solve the losed loop problem in constraint network by using local constraint propagation, variable elimination and constraint modularization. With this algorithm, we have implemented a knowledge-based system (intelligent CAD) for supporting machine design interactively. In this paper, we present newer constraint satisfaction algorithm which can solve inequalities or under-constrained problems in constraint network, interactively and efficiently. This algorithm is a hybrid type of using both declarative description (constraint represention) and optimization algorithm (Simulated Annealing), simultaneously. The under-constrained problems are represented by constraint networks and satisfied completely with this algorithm. The usefulness of our algorithm will be illustrated by the application to a gear design.

• 제어로봇시스템학회논문지
• /
• 제6권4호
• /
• pp.268-275
• /
• 2000

The increasing technological demands of today call for complex systems, which in turn involve a series of optimization problems with some equality or inequality constraints. In this paper, we presents a real-coded genetic algorithm(RCGA) as an optimization tool which is implemented by three genetic operators based on real coding representation. Through a lot of simulation works, the optimum settings of its control parameters are obtained on the basis of global off-line robustness for use in off-line applications. Two optimization problems are Presented to illustrate the usefulness of the RCGA. In case of a constrained problem, a penalty strategy is incorporated to transform the constrained problem into an unconstrained problem by penalizing infeasible solutions.

• 디지털융복합연구
• /
• 제2권2호
• /
• pp.45-62
• /
• 2004

E-commerce is now a familiar form of commercial transaction, especially in the transactions between businesses. This online transaction poses a good deal of problems to the traditional tax system and administration. Realignment of tax system and tax administration in the e-commerce is one of the major topics on the International problem. In the area of consumption tax, they reaffirmed the destination principle. They agreed to decide the recipient's business presence and usual residence as the place of consumption. In the area of consumption tax, they reaffirmed the destination principle. They agreed to decide the recipient's business presence and usual residence as the place of consumption. Currently, the Korean VAT law does not have a basis for taxation on international transactions that are considered to be services. Considering the tax revenue loss and the inequality between domestic suppliers and foreign suppliers when international transactions are not taxed, the Korean Tax Authority needs to amend the current law.

• 대한기계학회논문집
• /
• 제18권2호
• /
• pp.278-291
• /
• 1994

A computer-aided robust design (CARD) technique is developed to search for the design variables, optimal as well as robust in the sense of Taguchi method. The CARD technique can effectively handle inequality problems by employing the variable penalty method, and dynamic problems with many design variables and/or with mixed discrete and continuous variables. It is also capable of providing contributions of each design variables to the object funtion and information for future designs. As the illustrative examples, two dynamic systems, engine mounting system and in-line feeder, are treated.

• East Asian mathematical journal
• /
• 제26권1호
• /
• pp.25-38
• /
• 2010

In this paper, we introduce a hybrid iterative method for finding a common element of the set of solutions of a mixed equilibrium problem, the set of common mixed points of finitely many nonexpansive mappings and the set of solutions of the variational inequality for an inverse strongly monotone mapping in a Hilbert space. We show that the iterative sequences converge strongly to a common element of the three sets. The results extended and improved the corresponding results of L.-C.Ceng and J.-C.Yao.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.34.1-34
• /
• 2001

We deal with robust control problem for singularly perturbed linear systems with norm-bounded structured uncertainty under state constraints. We assume that the norm-bounded uncertainty is composed of repeated scalar-block and full-block forms. In the structured uncertainty, repeated scalar block forms account for uncertain physical parameter value and full-block forms may be some unknown nonlinear dynamics. In order deal with uncertainty and state constraints, we use LMI(Linear Matrix Inequality). The original problem is decomposed into two well behaved reduced order problems. Shinc two LMI problems are completely independent, each solution can be computed simultaneously and work in parallel.

• Kyungpook Mathematical Journal
• /
• 제62권2호
• /
• pp.229-242
• /
• 2022

In this paper, we introduce a new subclass of k-uniformly close-to-convex functions with respect to conjugate points. We study characterization, coefficient estimates, distortion bounds, extreme points and radii problems for this class. We also discuss integral means inequality with the extremal functions. Our findings may be related with the previously known results.

• 한국정밀공학회지
• /
• 제14권9호
• /
• pp.116-123
• /
• 1997

We have already presented the constraint satisfaction algorithm which could solve the closed loop porblem in constraint network by using local constraint propagation, variable elimination and constraint modularization. With this algorithm, we have implemented a knowledge-based system (intelligent CAD) for supporting machine design interactively. In this paper, we present newer constraint satisfaction algorithm which can solve inequalities or under-constrained problems in constraint network, interactively and effi- ciently. This algorithm is a hybrid type of using both declarative description (constraint representation) and optimization algorithm (Simulated Annealing), simultaneously. The under-constrained problems are represented by constraint networks and satisfied completely with this algorithm. The usefulness of our algorithm will be illustrated by the application to a gear design.

• 대한수학회보
• /
• 제60권4호
• /
• pp.1101-1129
• /
• 2023

In this study we propose a model of optimal retirement, consumption and portfolio choice of an individual agent, which encompasses a large class of the models in the literature, and provide a methodology to solve the model. Different from the traditional approach, we consider the problems before and after retirement simultaneously and identify the difference in the dual value functions as the utility value of lifetime labor. The utility value has an option nature, namely, it is the maximized value of choosing the retirement time optimally and we discover it by solving a variational inequality. Then, we discover the dual value functions by using the utility value. We discover the value function and optimal policies by establishing a duality between the value function and the dual value function. The model and approach offer a significant advantage for computation of optimal policies for a large class of problems.