• 한국경영과학회지
• /
• 제7권1호
• /
• pp.11-16
• /
• 1982

A method is described for the solution of a linearly constrained program with parametric nonlinear objective function. The algorithm proposed in this paper may be regarded as an extension of the simplex method for parametric linear programming. Namely, it specifies the basis at each stage such that feasibility ana optimality of the original problem are satisfied by the optimal solution of the reduced parametric problem involving only nonbasic variables. It is shown that under appropriate assumptions the algorithm is finite. Parametric procedures are also indicated for solving each reduced parametric problem by maintaining the Kuhn-Tucker conditions as the parameter value varies.

• 대한수학회보
• /
• 제26권2호
• /
• pp.127-134
• /
• 1989

This paper proposes a deformation method for solving practical nonlinear programming problems. Utilizing the nonlinear parametric programming technique with Quasi-Newton method [6,7], the method solves the problem by imbedding it into a suitable one-parameter family of problems. The approach discussed in this paper was originally developed with the aim of solving a system of structural optimization problems with frequently appears in various kind of engineering design. It is assumed that we have to solve more than one structural problem of the same type. It an optimal solution of one of these problems is available, then the optimal solutions of thel other problems can be easily obtained by using this known problem and its optimal solution as the initial problem of our parametric method. The method of nonlinear programming does not generally converge to the optimal solution from an arbitrary starting point if the initial estimate is not sufficiently close to the solution. On the other hand, the deformation method described in this paper is advantageous in that it is likely to obtain the optimal solution every if the initial point is not necessarily in a small neighborhood of the solution. the Jacobian matrix of the iteration formula has the special structural features [2, 3]. Sectioon 2 describes nonlinear parametric programming problem imbeded into a one-parameter family of problems. In Section 3 the iteration formulas for one-parameter are developed. Section 4 discusses parametric approach for Quasi-Newton method and gives algorithm for finding the optimal solution.

• 한국CDE학회논문집
• /
• 제21권4호
• /
• pp.453-461
• /
• 2016

The trend of using Grasshopper with Rhino3D actively in architectural design process is recently spreading around the world. Well-known architects and designers such as Zaha Hadid, Patrik Schmacher is famous for using Grasshopper as their main design tool. As a tool for so-called 'Parametric Design', Grasshopper is receiving much attention all over the world. Grasshopper as a visual programming language has an advantage that designers and non-professionals of computer can easily learn it and use it to their works. However, those designers tend to make inefficient approaches with Grasshopper compared to computer programming professionals. Meanwhile, the difference between other programming languages and Grasshopper leads to the need of different approaches from other programming languages. This study aims to propose desired approaches of Grasshopper programming or scripting to be able to break through the inefficient approaches that designer is likely to make, by examining the characteristics of Grasshopper and exploring the appropriate programming approaches for Grasshopper.

• Journal of applied mathematics & informatics
• /
• 제24권1_2호
• /
• pp.105-126
• /
• 2007

The purpose of this paper is to construct several parametric duality models and prove appropriate duality results under various generalized (${\theta},{\eta},{\rho}$)-V-invexity assumptions for a discrete minmax fractional programming problem involving arbitrary norms.

• Journal of applied mathematics & informatics
• /
• 제23권1_2호
• /
• pp.1-23
• /
• 2007

The purpose of this paper is to develop a fairly large number of sets of global parametric sufficient optimality conditions under various generalized $({\theta},\;{\eta},\;{\rho})-V-invexity$ assumptions for a discrete minmax fractional programming problem involving arbitrary norms.

• 한국경영과학회지
• /
• 제15권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.

• 제어로봇시스템학회논문지
• /
• 제12권12호
• /
• pp.1215-1219
• /
• 2006

Scheduling plays an important role in the process management in terms of providing profit-maximizing operation sequence of multiple orders and estimating completion times of them. In order to takes its full potential, varying conditions should be properly reflected in computing the schedule. The adjustment of scheduling decisions has to be made frequently in response to the occurrence of variations. It is often challenging because their model has to be adjusted and their solutions have to be computed within short time period. This paper employs Model Predictive Control(MPC) principles for updating the process condition in the scheduling model. The solutions of the resulting problems considering variations are computed using parametric programming techniques. The key advantage of the proposed framework is that repetition of solving similar programming problems with decreasing dimensionis avoided and all potential schedules are obtained before the execution of the actual processes. Therefore, the proposed framework contributes to constructing a robust decision-support tool in the face of varying environment. An example is solved to illustrate the potential of the proposed framework with remarks on potential wide applications.

• Coupled systems mechanics
• /
• 제7권6호
• /
• pp.707-729
• /
• 2018

The semi-active optimal vibration control of nonlinear torsion-bar suspension vehicle systems under random road excitations is an important research subject, and the boundedness of MR dampers and the uncertainty of vehicle systems are necessary to consider. In this paper, the differential equations of motion of the coupling torsion-bar suspension vehicle system with MR damper under random road excitation are derived and then transformed into strongly nonlinear stochastic coupling vibration equations. The dynamical programming equation is derived based on the stochastic dynamical programming principle firstly for the nonlinear stochastic system. The semi-active bounded parametric optimal control law is determined by the programming equation and MR damper dynamics. Then for the uncertain nonlinear stochastic system, the minimax dynamical programming equation is derived based on the minimax stochastic dynamical programming principle. The worst-case disturbances and corresponding semi-active bounded parametric optimal control are obtained from the programming equation under the bounded disturbance constraints and MR damper dynamics. The control strategy for the nonlinear stochastic vibration of the uncertain torsion-bar suspension vehicle system is developed. The good effectiveness of the proposed control is illustrated with numerical results. The control performances for the vehicle system with different bounds of MR damper under different vehicle speeds and random road excitations are discussed.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1986년도 한국자동제어학술회의논문집; 한국과학기술대학, 충남; 17-18 Oct. 1986
• /
• pp.629-632
• /
• 1986

Both combinatorial and parametric optimization are used in computer-aided design(CAD). The most commonly occuring parametric optimization problems in engineering design such as design of control systems, design of electric circuits are usually expressed either as differentiable or as nondifferentiable semi-infinite programming(SIP) problems. In this paper we express algorithms for a class of computer-aided design problems arising in control systems.

• 한국지능시스템학회논문지
• /
• 제20권6호
• /
• pp.780-785
• /
• 2010

본 논문은 물체인식이나 영상추적에 사용되는 컬러검출을 위한 GP(Genetic Programming) 기반의 컬러검출 모델을 제안한다. 기존의 컬러검출은 기본적인 RGB 모델에 대한 선형, 비선형 함수의 변환을 사용하거나, 최적화 기법이나 학습기법에 의해 조명 변화에 개선된 컬러 모델을 사용하고 있다. 하지만 대부분의 경우 색상 채널간의 간섭에 의해 다양한 색상에 대한 분류가 어렵고, 조명변화에 강인하지 못하다. 본 연구에서는 GP의 최적화된 학습기법과 모델 생성 기법을 통해 조명변화에 강인하고, 다중의 색상 검출이 가능하며, 파라미터 설정이 필요 없는 컬러 모델을 제안한다. 제안된 방법을 다양한 색상과 조명환경이 다른 영상에 대해서 기존 컬러모델과 비교 분석하였다.