• 한국경영과학회지
• /
• 제37권4호
• /
• pp.67-72
• /
• 2012

In this paper a new method of handling linear constraints for the genetic algorithm is suggested. The method is designed to maintain the feasibility of offsprings during the evolution process of the genetic algorithm. In the genetic algorithm, the chromosomes are coded as the vectors in the real vector space constrained by the linear constraints. A method of handling the linear constraints already exists in which all the constraints of equalities are eliminated so that only the constraints of inequalities are considered in the process of the genetic algorithm. In this paper a new method is presented in which all the constraints of inequalities are eliminated so that only the constraints of equalities are considered. Several genetic operators such as arithmetic crossover, simplex crossover, simple crossover and random vector mutation are designed so that the resulting offspring vectors maintain the feasibility subject to the linear constraints in the framework of the new handling method.

• Communications for Statistical Applications and Methods
• /
• 제9권2호
• /
• pp.473-478
• /
• 2002

A test for a single outlier in multivariate regression with linear constraints on regression coefficients using a mean shift model is derived. It is shown that influential observations based on case-deletions in testing linear hypotheses are determined by two types of outliers that are mean shift outliers with or without linear constraints, An illustrative example is given.

• 한국산업융합학회 논문집
• /
• 제7권2호
• /
• pp.181-186
• /
• 2004

This study presents a optimization of structure, in which constraints contain the conditions of stress and serviceability, while the sequential linear programming method (SLP) is used as a rational approach. The optimum design results contained on the limit state constraints are compared with those obtained by the only stress and ministry of construction enacted standard plans. A simple slab bridge is analysed numerically for illustration of the structural optimization. It may be asserted that serviceability constraints is very important to a structure design.

• Journal of applied mathematics & informatics
• /
• 제3권2호
• /
• pp.129-148
• /
• 1996

This paper propose the inference mechanism for handling linear polynomial constraints called consistency checking algorithm based on the feasibility checking algorithm borrowed from linear pro-gramming. in contrast with other approaches proposed algorithm can efficiently and coherented by linear polynomial forms. The developed algorithm is successfully applied to the symbolic simulation that offers a convenient means to conduct multiple simultaneous exploration of model behaviors.

• Structural Engineering and Mechanics
• /
• 제12권1호
• /
• pp.35-50
• /
• 2001

A numerical methodology is presented in this paper for the geometrically non-linear analysis of slender uni-dimensional structural elements under unilateral contact constraints. The finite element method together with an updated Lagrangian formulation is used to study the structural system. The unilateral constraints are imposed by tensionless supports or foundations. At each load step, in order to obtain the contact regions, the equilibrium equations are linearized and the contact problem is treated directly as a minimisation problem with inequality constraints, resulting in a linear complementarity problem (LCP). After the resulting LCP is solved by Lemke's pivoting algorithm, the contact regions are identified and the Newton-Raphson method is used together with path following methods to obtain the new contact forces and equilibrium configurations. The proposed methodology is illustrated by two examples and the results are compared with numerical and experimental results found in literature.

• Communications for Statistical Applications and Methods
• /
• 제10권2호
• /
• pp.519-524
• /
• 2003

We suggest a method of identifying outliers, using local influence, in regression when linear constraints are imposed on the regression coefficients. An example is given for illustration.

• 경영과학
• /
• 제10권2호
• /
• pp.1-9
• /
• 1993

This paper shows the application of fuzzy set and nonlinear membership function to linear programming problems in a fuzzy environment. In contrast to typical linear programming problems, the objectives and constraints of the problem in a fuzzy environment are defined imprecisely. This paper describes that fuzzy linear programming models can be formulated using the basic concepts of membership functions and fuzzy sets, and that they can be solved by quadratic programming methods. In a numerical example, a linear programming problem with two constraints and two decision variables is provided to illustrate the solution procedure.

• 대한산업공학회지
• /
• 제21권4호
• /
• pp.541-553
• /
• 1995

An efficient algorithm is proposed for a buffer allocation in a continuous flow line. The problem is formulated as a non-linear programming with linear constraints. The concept of pseudo gradient and gradient projection is employed in developing the algorithm. Numerical experiments show that the algorithm gives the actual optimal solutions to the problems with single linear constraint limiting the total buffer capacity. Also, even in longer production lines, it gives quite good solutions to the problems with the general linear resource constraints within a few seconds.

• Steel and Composite Structures
• /
• 제7권3호
• /
• pp.201-217
• /
• 2007

Two combinatorial optimization algorithms, tabu search and simulated annealing, are presented for the minimum-weight design of geometrically non-linear steel plane frames. The design algorithms obtain minimum weight frames by selecting suitable sections from a standard set of steel sections such as American Institute of Steel Construction (AISC) wide-flange (W) shapes. Stress constraints of AISC Load and Resistance Factor Design (LRFD) specification, maximum and interstorey drift constraints and size constraints for columns were imposed on frames. The stress constraints of AISC Allowable Stress Design (ASD) were also mounted in the two algorithms. The comparisons between AISC-LRFD and AISC-ASD specifications were also made while tabu search and simulated annealing were used separately. The algorithms were applied to the optimum design of three frame structures. The designs obtained using tabu search were compared to those where simulated annealing was considered. The comparisons showed that the tabu search algorithm yielded better designs with AISC-LRFD code specification.

• 한국지능시스템학회논문지
• /
• 제12권1호
• /
• pp.1-6
• /
• 2002

Hopfield는 선형 제한조건을 갖는 선형프로그램밍을 풀 수 있는 신경회로망을 제안하였는 데, 이 논문에서는 제한조건함수가 비선형함수를 포함하는 일반적인 최적화문제를 해결할 수 있는 신경망으로 확장하였다. 또한, 최적화문제를 신경회로망에 매핑시키는 방법, 그리고 회로로 구성하는 방법들이 논의되었다.