• 한국경영과학회지
• /
• 제22권3호
• /
• pp.1-9
• /
• 1997

We present an extension of the well-known generalized upper bound (GUB) constraint and consider a linear knapsack problem with both the extended GUB constraints and the simple upper bound (SUB) constraints. An efficient algorithm of order O($n^2log n$) is developed by exploiting structural properties and applying binary search to ordered solution sets, where n is the total number of variables. A numerical example is presented.

• 한국경영과학회지
• /
• 제17권3호
• /
• pp.171-180
• /
• 1992

This paper proposes a solution approach to linear problems with many constraints of variable upper bound (VUB) type. This type of constraints are commonly found in various scheduling type problems for which tighter bounds are essential to achieve an efficiency in enumeration. An analytical framework based on factorization is adopted to devise a solution approach to the problem and extend it for more generalized VUB problem (GVUB). This research shows why the VUB type constraints are amenable to the factorization and gives a unified approach to generalized upper bound(GUB) problems, VUB problems and GVUB problems. Implementation issues are also included.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.344-344
• /
• 2000

Recently, the demand for high precision and large stroke in linear positioning systems is increasing in industry. A coarse-fine position control system composed of a linear motor and a piezoelectric actuator has such characteristics. Many optimal control laws have been applied to the position control of coarse-fine actuators but most of them did not take account into constraints. In this study, model predictive control (MPC) method with constraints is applied to the position control of the coarse-fine actuator and the performance of MPC is compared with those of conventional control laws.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 1993년도 봄 학술발표회논문집
• /
• pp.135-140
• /
• 1993

The optimum weight design of structure is to determine the combination of structural members which minimize the weight of structures and satisfy design conditions as well. Since most of loads and design variables considered in structural design have uncertain natures, the reliability-based optimization techniques need to be developed. The aim of this study is to estabilish the general algorithm for the minimum weight design of transmission tower structure system with reliability constraints. The sequential linear programming method is used to solve non-linear minimization problems, which converts original non-linear programming problems to sequential linear programming problems. The optimal solutions are produced for various reliability levels such as reliability levels inherent in current standard transmission tower cross-section and optimal transmission tower cross-section obtained with constraints of current design criteria as well as selected target reliability index. The optimal transmission towers satisfying reliability constraints sustain consistent reliability levels on all members. Consequently, more balanced optimum designs are accomplished with less structural weight than traditional designs dealing with deterministic design criteria.

• 영어어문교육
• /
• 제9권1호
• /
• pp.23-48
• /
• 2003

This paper provides an analysis of the linear constituent order of the NP in three different types of languages based on 33 languages: the NP with the prenominal modifiers, the NP with the postnominal modifiers, and the NP with both prenominal and postnominal modifiers (the mixed NP). Languages have NPs that feature different linear order, of the NP constituents. We attribute such different linear constituent orders within the NP to the linguistic distance and the limits imposed by the constituency and adjacency. We use the various kinds of alignment constraints which properly reflect the linguistic distance between the noun and each constituent. Language universals on word order provide us some general orders of various NP constituents. If we adopt the linguistic distance, the limits imposed by the constituency and the adjacency, and the alignment constraints, we can explain the complicated differences of NP constituent orders of languages of the world.

• 응용통계연구
• /
• 제15권1호
• /
• pp.73-84
• /
• 2002

계수에 대한 부등 제한조건이 있는 선형 회귀모형은 경제모형에서 가장 흔하게 다루어지는 것 중의 하나이다. 이는 특정 설명변수에 대한 계수의 부호를 음양 중 하나로 제한하거나 계수들에 대하여 순서적 관계를 주기 때문이다. 본 논문에서는 이러한 부등 제한이 있는 선형회귀 모형에서 유의한 설명변수의 선택을 해결하는 베이지안 기법을 고려한다. 베이지안 변수선택은 가능한 모든 모형의 사후확률 계산이 요구되는데 본 논문에서는 이러한 사후확률들을 동시에 계산하는 방법을 제시한다. 구체적으로 가장 일반적인 모형의 모수에 대한 사후표본을 깁스 표본기법을 적용시켜 얻은 후 이를 이용하여 모든 가능한 모형의 사후확률을 계산하고 실제적인 자료에 본 논문에서 제안된 방법을 적용시켜 본다.

• Journal of the Korean Statistical Society
• /
• 제8권2호
• /
• pp.107-109
• /
• 1979

Consider a linear model with n observations and k explanatory variables: (1)b $y=X\beta+u, u\simN(0,\sigma^2I_n)$. We assume that the model satisfies the ideal conditions. Consider the general linear constraints on regression coefficient vector: (2) $R\beta=r$, where R and r are known matrices of orders $q\timesk$ and q\times1$ respectively, and the rank of R is $qk+q$.

• 대한전자공학회논문지
• /
• 제26권11호
• /
• pp.1850-1856
• /
• 1989

For determining motion/structure of a 3-D rigid object from point correspondences over two perspective views, a linear algorithm was developed in Refs. 3 and 4. This algorithm fails when the 3-D points under observation satisfy certain geometrical constraints, as demonstrated in Refs. 7 and 8. In the present paper, we show that the linear algorithm can be resurrected in these degenerate cases by adding additional lower order polynomial constraints to original equations.

• 한국경영과학회지
• /
• 제26권3호
• /
• pp.95-104
• /
• 2001

In this paper, we consider a maximin version of the linear programming knapsack problem with extended generalized upper bound (GUB) constraints. We solve the problem efficiently by exploiting its special structure without transforming it into a standard linear programming problem. We present an O(n$^3$) algorithm for deriving the optimal solution where n is the total number of problem variables. We illustrate a numerical example.

• 국제학술발표논문집
• /
• The 2th International Conference on Construction Engineering and Project Management
• /
• pp.777-786
• /
• 2007

This paper presents a modified simulated annealing algorithm to optimize linear scheduling projects with multiple resource constraints and its effectiveness is verified with a proposed problem. A two-stage solution-finding procedure is used to model the problem. Then the simulated annealing and the modified simulated annealing are compared in the same condition. The comparison results and the reasons of improvement by the modified simulated annealing are presented at the end.