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

• 대한산업공학회지
• /
• 제27권1호
• /
• pp.25-29
• /
• 2001

We present a two dimensional linear programming knapsack problem with the extended GUB constraint. The presented problem is an extension of the cardinality constrained linear programming knapsack problem. We identify some new properties of the problem and derive a solution algorithm based on the parametric analysis for the knapsack right-hand-side. The solution algorithm has a worst case time complexity of order O($n^2logn$). A numerical example is given.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1994년도 추계학술발표회 발표논문집; 연세대학교경영관, 서울; 8 Oct. 1994
• /
• pp.36-48
• /
• 1994

• 수산해양기술연구
• /
• 제49권2호
• /
• pp.153-160
• /
• 2013

Control allocation is an important part of a system. It implements the function that map the desired command forces from the controller into the commands of the different actuators. In this paper, the authors present an approach for solving constrained control allocation problem in vessel system by using multi-parametric quadratic programming (mp-QP) algorithm. The goal of mp-QP algorithm applied in this study is to compute a solution to minimize a quadratic performance index subject to linear equality and inequality constraints. The solution can be pre-computed off-line in the explicit form of a piecewise linear (PWL) function of the generalized forces and constrains. The efficiency of mp-QP approach is evaluated through a dynamic positioning simulation for a vessel by using four tugboats with constraints about limited pushing forces and found to work well.

• 대한산업공학회지
• /
• 제37권3호
• /
• pp.258-263
• /
• 2011

We study on a generalization of the two dimensional linear programming knapsack problem with the extended GUB constraint, which was presented in paper Won(2001). We identify some new parametric properties of the generalized problem and derive a solution algorithm based on the identified parametric properties. The solution algorithm has a worst case time complexity of order O($n^2logn$), where n is the total number of variables. We illustrate a numerical example.

• Structural Engineering and Mechanics
• /
• 제23권4호
• /
• pp.431-447
• /
• 2006

A new incremental finite element model is developed to simulate the frictional contact of elastic bodies. The incremental convex programming method is exploited, in the framework of finite element approach, to recast the variational inequality principle of contact problem in a discretized form. The non-classical friction model of Oden and Pires is adopted, however, the friction effect is represented by an equivalent non-linear stiffness rather than additional constraints. Different parametric studies are worked out to address the versatility of the proposed model.

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

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

• Communications for Statistical Applications and Methods
• /
• 제29권6호
• /
• pp.641-653
• /
• 2022

Penalized least squares methods are important tools to simultaneously select variables and estimate parameters in linear regression. The penalized maximum likelihood can also be used for the same purpose assuming that the error distribution falls in a certain parametric family of distributions. However, the use of a certain parametric family can suffer a misspecification problem which undermines the estimation accuracy. To give sufficient flexibility to the error distribution, we propose to use the symmetric log-concave error distribution with LASSO penalty. A feasible algorithm to estimate both nonparametric and parametric components in the proposed model is provided. Some numerical studies are also presented showing that the proposed method produces more efficient estimators than some existing methods with similar variable selection performance.

• 한국공작기계학회논문집
• /
• 제18권2호
• /
• pp.154-161
• /
• 2009

In order to implement continuous-path motion on a robot, it is necessary to blend one joint motion to another joint motion near a via point in a trapezoidal form of joint velocity. First, the velocity superposition using parametric interpolation is proposed. Hybrid motion blending is defined as the blending of different two type's motions such as blending of joint motion with linear motion, in the neighborhood of a via point. Second, hybrid motion blending algorithm is proposed based on velocity superposition using parametric interpolation. By using a 3-axis SCARA (Selective Compliance Assembly Robot Arm) robot with $LabVIEW^{(R)}$ $controller^{(1)}$, the velocity superposition algorithm using parametric interpolation is shown to result in less vibration, compared with PTP(Point- To-Point) motion and Kim's algorithm. Moreover, the hybrid motion $algorithm^{(2)}$ is implemented on the robot using $LabVIEW^{(R)(1)}$ programming, which is confirmed by showing the end-effector path of joint-linear hybrid motion.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.428-432
• /
• 2003

Quantitative Feedback Theory (QFT) is one of most effective methods of robust controller design and can be considered as a suitable method for systems with parametric uncertainties. Particularly it allows us to obtain controllers less conservative than other methods like $H_{\infty}$ and ${\mu}$-synthesis. In QFT method, we transform all the uncertainties and desired specifications to some boundaries in Nichols chart and then we have to find the nominal loop transfer function such that satisfies the boundaries and has the minimum high frequency gain. The major drawback of the QFT method is that there is no effective and useful method for finding this nominal loop transfer function. The usual approach to this problem involves loop-shaping in the Nichols chart by manipulating the poles and zeros of the nominal loop transfer function. This process now aided by recently developed computer aided design tools proceeds by trial and error and its success often depends heavily on the experience of the loop-shaper. Thus for the novice and First time QFT user, there is a genuine need for an automatic loop-shaping tool to generate a first-cut solution. In this paper, we approach the automatic QFT loop-shaping problem by using an algorithm involving Linear Programming (LP) techniques and Genetic Algorithm (GA).