• Journal of Energy Engineering
• /
• v.4 no.3
• /
• pp.344-353
• /
• 1995

화력발전기의 주간운용계획을 수립함에 있어 여러 에너지사용에 관련된 제약조건의 지배를 받는 발전기를 효율적으로 고려할 수 있는 새로운 방법을 개발하였다. 우선 이를 위하여 에너지제약을 고려한 운용계획문제를 Lagrangian Relaxation법에 의해 모델링하였다. 또한 에너지제약을 만족하는 최적의 화력발전기의 기동정지계획 및 발전출력을 원문제 내에서 구할 수 있도록 하였으며, 쌍대문제를 효율적으로 풀 수 있는 알고리즘을 개발하여 보다 빠르고 정확한 해를 구할 수 있도록 하였다. 제안한 방법을 시험계통 및 대규모 실계통에 적용하여 유용성을 검증하였다.

• Proceedings of the KIEE Conference
• /
• 2011.07a
• /
• pp.166-167
• /
• 2011

본 논문에서는 전력 소비자 입장에서 전력가격에 큰 비중을 차지하는 System Marginal Cost(SMP)를 줄이는 방법으로 ESS를 포함하여 Unit Commitment(UC)를 수행하는 방법과 그에 따른 효과를 분석하였다. 먼저 본 논문에서는 일반적인 UC를 Lagrangian Relaxation(LR) 기법으로 얻은 최적의 결과 값을 토대로 ESS를 추가하였다. 기존의 LR알고리즘으로부터 얻은 결과 값에 ESS를 추가하는 방법으로는 Dynamic Programming 방법의 한 종류인 Label Correcting Methods[]를 사용하였다. 기존의 UC 알고리즘 결과 값을 토대로 ESS를 추가하여 SMP 감소효과 분석을 위해 실 계통에서 사용되는 종류별 발전기 10대와 임의적으로 설정한 24시간의 부하 값을 토대로 MATLAB을 이용해서 구현하였고, 결과 값을 통해 실질적인 SMP 감소효과 유무를 확인할 수 있었다.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.31 no.4
• /
• pp.35-47
• /
• 2006

This paper considers an integrated scheduling problem for consecutive production and delivery stages in a two-stage supply chain. The Production is performed on a single facility and then the finished products are delivered to the customer by capacitated multiple vehicles. The objective of this paper is to obtain job sequencing and delivery batching minimizing the total cost of the associated WIP inventory, finished product inventory and delivery. The inventory cost is characterized by the sum of weighted flowtime. The delivery cost is proportional to the required number of delivery batches. Some polynomial-solvable cases are derived. For the general case, two efficient heuristic algorithms are suggested, and then the heuristics are tested through some numerical experiments.

• Journal of Korean Institute of Industrial Engineers
• /
• v.20 no.2
• /
• pp.19-30
• /
• 1994

Generally, a planning problem in a flexible manufacturing system is considered to be a composite of three interdependent tasks : part selection, loading, and routing mix. This research presents a mathematical model which can concurrently solve part selection, loading, and routing mix problems, so the problems that are caused by treating the planning problems independently are solved. The mathematical model is aimed to minimize system unbalance and the number of late parts, including constraints such as machine capacity, tool magazine capacity, and tool inventory. To illustrate the application of the model, an example is included. Solution procedure based on Lagrangian relaxation is also suggested for larger-sized problems.

• Journal of Communications and Networks
• /
• v.13 no.6
• /
• pp.633-638
• /
• 2011

In this paper, we consider resource allocation with proportional fairness in the downlink orthogonal frequency division multiple access relay networks, in which relay nodes operate in decode-and-forward mode. A joint optimization problem is formulated for relay selection, subcarrier assignment and power allocation. Since the formulated primal problem is nondeterministic polynomial time-complete, we make continuous relaxation and solve the dual problem by Lagrangian dual decomposition method. A near-optimal solution is obtained using Karush-Kuhn-Tucker conditions. Simulation results show that the proposed algorithm provides superior system throughput and much better fairness among users comparing with a heuristic algorithm.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.1
• /
• pp.27-36
• /
• 2000

We perform a computational complexity analysis of a heuristic algotithm proposed in the literature for the combinatorial optimization problems extended with a single side-constraint. This algorithm, although such a view was not given in the original work, is a disguised version of an optimal Lagrangian dual solution technique. It also has been observed to be a very efficient heuristic producing near-optimal solutions for the primal problems in some experiments. Especially, the number of iterations grows sublinearly in terms of the network node size so that the heuristic seems to be particularly suitable for the applicatons such as routing with semi-real time requirements. The goal of this paper is to establish a polynomal worst-case complexity of the algorithm. In particular, the obtained complexity bound suports the sublinear growth of the required iterations.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.24 no.62
• /
• pp.11-20
• /
• 2001

At the initial deployment of B-ISDN, the heterogeneity of services and the bandwidth requirement make dimensioning of B-ISDN much more complicated than the dimensioning of homogeneous circuit or packet switched networks. Therefore B-ISDN must be extended gradually according to future telecommunication technology or service demands. In this paper, we propose a mathematical formulation for dimensioning problem of B-ISDN extension, considering the characteristics of ATM(Asynchronous Transfer Mode) such as various quality of services, the statistical multiplexing effects of VPCs(Virtual Path Connections) and the modularity of transmission links allocated when new B-ISDN nodes are given. The algorithm based on the simultaneous linear approximation technique and Lagrangian relaxation method and some numerical results are also presented.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.2
• /
• pp.145-151
• /
• 2015

As order quantity is increased, the ordering cost per item will be cheaper due to saving of transportation and material handling costs. In this paper, two realistic assumptions such as quantity discount and budget limit are considered. Quantity discount means that all units in the order will be discounted according to the predetermined order levels. Budget limit represents that the costs for inventory investments are bounded. This paper develops a Lagrangian relaxation approach for a continuous review inventory model with a budget constraint and quantity discounts. Computational results indicate that the proposed approach provides a good solution. Sensitivity analysis is done to get some insights on budget limit and quantity discount. As budget limit or the amount of discount according to order quantity is increased, order quantity is increased, whereas reorder point is not always increased.

• Proceedings of the KIEE Conference
• /
• 1993.07a
• /
• pp.117-119
• /
• 1993

This paper presents a new method for solving unit commitment problem including hydro and pumped storage hydro units in a large scale power system. The proposed method makes it possible to get variable power of hydro and pumped storage hydro units and results in the better unit commitment with good convergency. Moreover this paper proposes an unit commitment algorithm to consider variable power of these units effectively by Lagrangian Relaxation method. By applying the proposed method to the test system, it is verified the usefulness of this method.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.3
• /
• pp.1132-1136
• /
• 2014

In the context of increasing electric energy consumption in a data center, energy efficiency improvement is strongly emphasized. In a data center, electric energy is largely consumed by DC power supply system, which is based on a rectifier composed by multiple parallel converters. Therefore, rectifier efficiency must be improved for minimizing loss of DC power supply system. Rectifier efficiency can be modulated by load allocation to converters because converter efficiency depends on input AC power. In this paper, we propose a new control method to maximize rectifier efficiency. The method can control load allocation to converters by introducing active power converter control scheme and start-and-stop of converters. In order to illustrate optimal load allocations in a rectifier, a maximization problem of rectifier efficiency is formulated as a nonlinear optimization one. The problem is solved by Lagrangian relaxation method and the computation results provide the validity of proposed method.