• The Korean Journal of Applied Statistics
• /
• v.27 no.7
• /
• pp.1151-1161
• /
• 2014

Despite the fact that the optimal design for nonlinear model depends on the unknown quantity of parameter to estimate basically, its popularity is growing in bio and engineering statistics area since all those models in the area are virtually nonlinear. In this paper we have dealt with the case when the researcher has multiple objectives in experimentation, decision among the competing models, protection against the departure from the assumed model, and the con icting interests among design criteria. To tackle these issues we attempted several new approaches which are taking advantage of the easiness of constrained optimal design. Several nonlinear models were tested.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06b
• /
• pp.318-320
• /
• 2012

증강현실 콘텐츠를 2D 이미지기반으로 저작할 때, 작성된 증강현실 콘텐츠를 카메라 시점과 일치시켜 합성하기 위해 호모그래피를 이용한다. 이때 증강현실 콘텐츠를 이질감 없이 합성하기위해 정확한 호모그래피 행렬을 추정해야 한다. 그러나 호모그래피 행렬 추정 시 사용되는 특징점들이 선형을 이루거나, 특정 영역에 군집을 이루는 경우 정확한 호모그래피 행렬을 추정하지 못하는 문제가 발생한다. 본 논문에서는 이러한 문제를 해결하기 위해 선형제약, 거리제약을 적용한 CSP 기반의 RANSAC 알고리즘을 제안한다. 실험결과 호모그래피 행렬 추정 시 CSP를 적용한 RANSAC 알고리즘이 기존의 랜덤샘플링 또는 삼각형의 넓이를 이용한 샘플링을 적용한 RANSAC 알고리즘보다 정확도가 향상됨을 보였다.

• Proceedings of the KIEE Conference
• /
• 2003.07d
• /
• pp.2002-2004
• /
• 2003

본 논문에서는 시스템의 모델 불확실성과 백색 가우시안이 아닌 $L_2$ 잡음이 존재하는 경우에 시스템 상태변수의 효과적인 추정을 위한 강인 필터를 제안한다. 제안된 필터는 적분이차제약조건(integral quadratic constraint)을 갖는 일반적인 비선형 불확실 시스템을 위해 선형근사화를 통하여 구성된다. 또한 제안된 필터의 중요한 특성인 변형된 $H{\infty}$ 성능 지수를 유도하고, 해석적 방법을 통해 제안된 필터의 잡음과 시스템 파라미터 불확실성에 대한 강인성을 분석하며, 시뮬레이션 결과를 통하여 제안된 필터가 추정치의 정확도를 효과적으로 향상시키는 것을 보인다.

• Journal of Energy Engineering
• /
• v.23 no.4
• /
• pp.150-159
• /
• 2014

Since the release of mid-term domestic GHG goals until 2020, in 2009, some various GHG reduction policies have been proposed. There are two types of modeling approaches for identifying options required to meet greenhouse gas (GHG) abatement targets and assessing their economic impacts: top-down and bottom-up models. Examples of the bottom-up optimization models include MARKAL, MESSAGE, LEAP, and AIM, all of which are developed based on linear programming (LP) with a few differences in user interface and database utilization. In this paper, we suggest a simplified LP formulation and how can build it through step-by-step procedures.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.30 no.2
• /
• pp.83-88
• /
• 2007

본 논문에서 선형함수의 곱의 형태로 표현된 비선형 함수를 목적식 또는 제약식에 가지는 비선형 최적화 문제를 새로운 변수를 추가하여 선형 Relaxation 최적화 문제로 Reformulation 하는 기법을 소개한다. 특히, 선형함수의 곱의 형태를 가지는 비선형 함수를 포함하는 비선형 정수 최적화 문제를 선형 정수 최적화 문제로 Relaxation할 경우 두 최적화 문제의 해가 일치함을 보인다. 또한 소개된 Relaxation 기법을 응용하여, 추가되는 변수의 수를 증가시킴으로서, 보다 Tight한 Relaxation 문제를 도출하는 과정에 대하여 소개한다.

• Journal of the Korea Convergence Society
• /
• v.7 no.5
• /
• pp.213-219
• /
• 2016

This paper presents a branch-and-bound algorithm for solving the concave minimization problem with upper bounded variables whose single constraint is linear. The algorithm uses simplex as partition element. Because the convex envelope which most tightly underestimates the concave function on the simplex is uniquely determined by solving the related linear equations. Every branching process generates two subsimplices one lower dimensional than the candidate simplex by adding 0 and upper bound constraints. Subsequently the feasible points are partitioned into two sets. During the bounding process, the linear programming problems defined over subsimplices are minimized to calculate the lower bound and to update the incumbent. Consequently the simplices which do certainly not contain the global minimum are excluded from consideration. The major advantage of the algorithm is that the subproblems are defined on the one less dimensinal space. It means that the amount of work required for the subproblem decreases whenever the branching occurs. Our approach can be applied to solving the concave minimization problems under knapsack type constraints.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1994.04a
• /
• pp.41-41
• /
• 1994

• Journal of Korean Association for Spatial Structures
• /
• v.6 no.1 s.19
• /
• pp.75-82
• /
• 2006

The single layer latticed dome is very sensitive on the slenderness ratio and half open angle of the elements, load condition, and the connection type because it is organized by a lot of thin elements, so we have to use the geometrically nonlinear buckling load when the buckling of the structures is analyzed. But, it is very difficult to design the single layer latticed domes considered all renditions. Therefore the purpose of this paper is to propose the appropriate design method of the single layer latticed dome considered the geometrically nonlinear buckling load in base of the linear buckling load by the eigenvalue analysis.

• The Proceedings of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.8 no.1
• /
• pp.37-45
• /
• 1994

A method of optimal active and reactive power control for economic operation in electrical power system is presented in this paper. The major features and techniques of this paper are as follows: 1) The method presented for obtaining the equivalent active power balance equation applying the sparse Jacobian matrix of power flow equation instead of using B constant as active power Balance equation considering transmission loss, and for determining directly optimal active power allocation without repeating calculations. 2) More reasonable and economic profit by minimizing total fuel cost of thermal power plants instead of using transmission loss as objective function of reactive Power control can be achieved. 3) Particularly in reactive power control, computing time can be considerably reduced by using Fuzzy Linear Programming instead of using conventional Linear Programming.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.7 no.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.