• 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.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.37 no.1
• /
• pp.90-99
• /
• 1995

In this study, the algorithm for the optimum design of cantilever retaining wall was de veloped and solved using Modified Method of Feasible Directions(MMFD), Sequential Linear Programming(SLP) and Sequential Quadratic Programming(SQP). The algorithm was applied to the optimum design of 3-different height cantilever re tairing walls. It was shown that even though the starting points and optimization strategies are dif- ferent, the objective function and optimum design variables converge to within a close range, and consequently the reliability and efficiency of the underlying optimum design algorithm can be verified. It is expected that the optimum design algorithm developed in this study can be utilized efficiently for the optimum design of any scale cantilever retaining wall. Using optimum design method, cantilever retaining wall will be designed more economi- cally and reasonably than using traditional design method.

• Journal of Korea Water Resources Association
• /
• v.32 no.5
• /
• pp.525-535
• /
• 1999

An optimal unit commitment model for efficient management of water and energy resources in a basin using combined mixed integer programming is developed. The combined mixed integer programming model is able to solve the inconsistency problem that may occur from mixed integer programming models. The technique which enables the use of conditional constraints and either-or constraints in the linear programming is also suggested. As a result of applying the combined mixed integer programming model to Lower Colorado River Basin in United States. the basin efficiency is decreased by 1.53% from the results of the mixed integer programming, while it is increased by 0.67% from the results of the historical operation. It is found that the decreased allowable error between power supplies and demands in the combined mixed integer programming causes the decreased basin efficiency.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.2
• /
• pp.27-35
• /
• 2009

Integer programming is a very effective technique for searching optimal solution of combinatorial optimization problems. However, its applicability is limited to linear models. In this paper, I propose an effective method for solving a nonlinear optimization problem by integrating the powerful search performance of integer programming and the flexibility of neighborhood search algorithms. In the first phase, integer programming is executed with subproblem which can be represented as a linear form from the given problem. In the second phase, a neighborhood search algorithm is executed with the whole problem by taking the result of the first phase as the initial solution. Through the experimental results using a nonlinear maximal covering problem, I confirmed that such a simple integration method can produce far better solutions than a neighborhood search algorithm alone. It is estimated that the success is primarily due to the powerful performance of integer programming.

• Proceedings of the KIEE Conference
• /
• 1984.07a
• /
• pp.167-169
• /
• 1984

• Proceedings of the Korea Water Resources Association Conference
• /
• 2010.05a
• /
• pp.297-301
• /
• 2010

본 연구에서는 비선형계획법을 이용하여 해공간의 비선형성을 적절히 제어하고, 예측유입량의 불확실성을 고려하면서 하나의 최적 의사결정을 내릴 수 있는 다목적댐 최적 연계운영 모형을 개발하였다. 모형의 적용성을 검증하기 위하여 금강유역에 모형을 적용하고 2020~2021년 이수기에 대해 가상으로 운영하여 보았으며, 적용결과 의사결정평균모형에 비해 향상된 결과를 도출하는 것을 확인하였다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1992.04b
• /
• pp.415-424
• /
• 1992

본 논문에서는 정수선형계획법을 반도체 설계자동화과정에 이용한 예를 보인다. 반도체 설계자동화과정은 매우 여러 단계를 거치게 되는데, 본 논문에서는 상위수준 합성중 스케쥴링(scheduling)문제에 정수선형계획법을 응용하였다. 여기서 스케쥴링 문제는 설계자동화의 초기단계에서 알고리듬으로 주어진 입력을 하드웨어 요소들로 표현하는 과정에서 매 제어단계(control step)에서 수행하여야 할 연산내용을 결정하는 문제이다. 스케쥴링의 목적함수는 주어진 제어단계 갯수내에서 하드웨어 비용의 최소화이다. 이를 위해 우선 ASAP(As Soon As Possible)과 ALAP(As Late As Possible)방법을 이용하여 매 연산의 수행시작이 가능한 가장 빠른 시간과 가장 늦은 시간을 구한다. 이 두 시간 사이가 각 연산의 time frame이 되며 이를 이용하여 스케쥴링 문제를 정수 선형 계획법으로 공식화하여 풀었다. 이 공식화는 chaining, multicycle연산, pipeline data path, pipeline기능 유닛등에도 일반화하여 적용가능함을 보인다. 실험을 통해 본 공식화 방법이 기존 알고리듬에 의한 해보다 우수한 해를 제공함을 보인다. 비교를 위해 잘 알려진 benchmark회로인 bandpass filter를 이용하였는데 이 회로는 8개의 덧셈, 7개의 뺄셈 및 12개의 곱셈연산을 포함하고 있다. 제시된 알고리듬은 이 회로를 8개의 제어단계내에 총비용 675 (연산별 하드웨어 비용은 라이브러리로 주어짐)로 스케쥴링하였는데 이는 기존의 최상의 결과인 685보다 우수한 결과이다.

• Proceedings of the KIPE Conference
• /
• 2019.11a
• /
• pp.208-209
• /
• 2019

본 논문에서는 ESS를 이용한 전력 계통의 Peak-Shaving 제어 알고리즘 수립에 대한 연구 결과를 제시한다. 과거의 요일별 전력수요 데이터를 이용하는 경우 ESS가 포함된 전력 시스템의 연결점(PCC)에서 전력 및 에너지 평형 방정식을 수립할 수 있고, ESS의 전력 및 에너지 용량에 따른 전기요금 최소화를 목적 함수로 한 선형 계획법 문제를 정식화할 수 있다. 선형 계획법 문제 해결을 통해 ESS가 추가되는 경우에 대한 경제성을 분석할 수 있고, 이로부터 ESS의 적합한 용량도 선정할 수 있다. 또한 부하 크기 및 시간대별 ESS 최적 전력 이용 패턴을 확인할 수 있기 때문에 실 운용 로직 설계를 위한 가이드로 결과를 활용할 수 있다. 본 논문에서는 제안된 방법을 설명하기 위한 일 예시로서, 시간대별 전력 부하 패턴의 기존 연구 결과로부터 도출한 부하 전력 곡선을 이용하여 선형 계획법을 이용한 Peak-Shaving 최적 제어 결과를 제시하고, 이를 기반으로 실시간 운전 가능한 규칙 기반 알고리즘을 설계하여 ESS의 적용에 따른 요금 절감 효과를 제시한다.

• Journal of Korean Society of Forest Science
• /
• v.80 no.4
• /
• pp.427-435
• /
• 1991

Linear programming(LP) is a well-known method in optimizing timber harvest schedules. This paper describes a linear programming formulation of korean pine stands for timber harvest scheduling problems. Simulation technique and LP were applied to optimize the time and space distribution of the sustained yield for the 10-year forest management planning horizon. Growthfunction of korean pine stands in study area was derived with the yield table. This growthfunction was contained to the simulation model in estimating of changing stand volume conditions for the planning horizon. These estimated values were served as the basic data of LP model, and LP model was formulated with the maximum of periodical harvest volume calculated by the classical yield regulation method (Paulsen-Hundeshagen formula) and the maximum of periodical harvest area calculated for the normal age distribution. The timber harvest schedule was established periodically for each subcompartment of korean pine stands in experiment forest of College of Forestry in Kangweon National University with the here developed LP model.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.53-56
• /
• 2000

The problem ( Ρ ) of optimizing a linear function d$\^$T/x over the set of efficient set for a multiple objective linear program ( Μ ) is difficult because the efficient set is nonconvex. There some interesting properties between the objective linear vector ｄ and the matrix of multiple objectives C and those properties lead us to establish criteria to solve ( Ρ ) with a linear program. In this paper we investigate a system of the linear equations C$\^$T/${\alpha}$=d and construct two linearly independent positive vectors ${\mu}$, ν such that ${\alpha}$=${\mu}$-ν. From those vectors ${\mu}$, ν, solving an weighted sum linear program for finding an efficient extreme point for the ( Μ ) is a way to get an optimal solution ( Ρ ). Therefore our theory gives an easy way of solving nonconvex program ( Ρ ) with a weighted sum linear program.