• 대한산업공학회지
• /
• 제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
• /
• 제84권1호
• /
• pp.129-141
• /
• 2022

It has previously been proposed that the yield-line method of analysis for reinforced concrete slabs could be automated via the use of rigid finite elements, assuming all deformations occur along element edges. However, the solutions obtained using this approach can be observed to be highly sensitive to mesh topology. To address this, a revised formulation that incorporates modified yield criteria to account for the presence of non-zero shear forces at interfaces between elements is proposed. The resulting formulation remains simple, with linear programming (LP) still used to obtain solutions for problems involving Johansen's square yield criteria. The results obtained are shown to agree well with literature solutions for various slab problems involving uniform loading and a range of geometries and boundary conditions.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2003년도 추계학술대회 및 정기총회
• /
• pp.89-92
• /
• 2003

It is often that a large-scale linear programming(LP) problem may contain many constraints which are redundant or cause infeasibility on account of inefficient formulation or some errors in data input. Presolving or preprocessing is a series of operations which removes the underlying redundancy or detects infeasibility in the given LP problem. It is essential for the speedup of an LP system solving large-scale problems to implement presolving techniques. For the recovery of an optimal solution for the original problem from an optimal solution for the presolved problem, a special procedure, so called postsolving, must be applied. In this paper, we present how a postsolving procedure is constructed and implemented in LPABO, a interior-point based LP system. Briefly, all presolving processes are logged in a data structure in LPABO, and after the end of the solution method an optimal solution for the original problem is obtained by tracing the logs. In each stage of the postsolving procedure, the optimality of intermediate solutions is maintained. We tested our postsolving procedure on Netlib, Gondzio and Kennington LP data sets, and concluded that the computational burden of the procedure is relatively negligible compared with the total solving time.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 The Third Asian Fuzzy Systems Symposium
• /
• pp.501-505
• /
• 1998

In this paper, an LP problem with convex polyhedral objective coefficients is treated. In the problem, the interactivities of the uncertain objective coefficients are represented by a bounded convex polyhedron (a convex polytope). We develop a computation algorithm of a maxmin achievement rate solution. To solve the problem, first, we introduce the relaxation procedure. In the algorithm, a sub-problem, a bilevel programing problem, should be solved. To solve the sub-problem, we develop a solution method based on a branch and bound method. As a result, it is shown that the problem can be solved by the repetitional use of the simplex method.

• 한국수자원학회논문집
• /
• 제48권12호
• /
• pp.1051-1064
• /
• 2015

본 논문은 선형계획모형을 이용하여 H 아리수 정수 센터의 최적 취수량 결정 방법을 연구 하였다. 현재 H 아리수 센터에서는 관리자의 경험과 숙련도에 의지하여 취수량을 결정하고 있다. 그런데 매시 변하는 수요를 만족 시키면서 시간대별로 요금이 서로 다른 전력의 사용을 최소화 하는 취수량 결정은 근무자들의 경험과 숙련도를 넘어서는 간단한 문제가 아니다. 따라서 수리적 기법 중 하나인 선형계획모형을 이용해 취수량을 결정하고, 비용 절감을 시도하였다. 본 연구에서 제안한 선형계획 모형은 수요예측치를 기본 입력자료로 사용하고 있는데 예측오차가 발생할 경우 정수지 높이 제한을 위반하는 경우가 발생한다. 이를 해결하기 위해서는 정확한 수요예측이 선행되어야 한다. 그러나 아무리 좋은 예측 기법을 사용하더라도 실수요와 오차는 있게 마련이고 이는 여전히 높이 제한의 제약을 만족 시키지 못하는 결과를 불러일으킨다. 따라서 예측오차를 수용 할 수 있는 안전 마진 상수를 이용한 대안을 제안하였다. 본 연구에서 제안한 선형 계획 모형을 통한 취수량 결정은 수위 모니터링을 위해 항시 작업자가 근무 할 필요가 없기 때문에 인건비 면에서도 많은 절약이 예측되어 총 비용 감축은 훨씬 더 많으리라 기대된다.

• 한국인터넷방송통신학회논문지
• /
• 제23권1호
• /
• pp.151-156
• /
• 2023

본 논문은 주어진 예산과 광고를 접하는 최소 인원수를 초과하는 제약조건을 만족시키면서 신제품에 대한 인지도를 극대화시키기 위해 다수의 광고매체들 중에서 어느 광고매체를 몇 회 광고해야 하는지를 결정하는 최적화 문제를 다룬다. 본 문제에 대해 지금까지는 선형계획법 (LP) 소프트웨어 패키지를 활용하는 수학적 접근법만이 활용되고 있으며, 다항시간 알고리즘은 제안되지 않고 있는 실정이다. 본 논문은 이 문제에 대해 O(nlog n) 수행 복잡도의 다항시간으로 최적 해를 얻을 수 있는 휴리스틱 알고리즘을 제안한다. 제안된 방법은 광고매체를 가장 경제적으로 선정하는 평가기준을 제안하였으며, 이 평가기준을 적용하여 광고매체 선정과 광고횟수를 결정하였다. 제안된 알고리즘은 Excel을 활용하였음에도 불구하고, 실험 데이터에 적용한 결과 LP와 동일한 결과를 얻었다.

• 수산경영론집
• /
• 제25권1호
• /
• pp.37-59
• /
• 1994

Many studies to cope with the present problems of Korean coastal and offshore fisheries has been performed, but these were done partly in necessities and general studies for Korean inshore and offshore fisheries are in early stage. Most of these studies adopted analytical way of approach for each fishery individually and they could not reflect the effect of correlated interaction among fisheries on the several common species/stocks, and thus optimal effort allocation was impossible. To consider general fisheries and optimal effort allocation among competing mixed species, a linear programming (LP) approach is applied in this study and introduced into 16 important inshore and offshore fisheries with 13 constraining species which were chosen by annual yield order. This study is not based on the biological interaction among species (i.e., prey - predator system) but the technological interaction between species and fishing efforts. For the application of LP model in these fisheries, the standardization of fishing efforts through different fishing gears could not be successful and a new way of effort standardization through CPUE for vessel tonnage was originated. Total standardized fishing effort on a particular species i, Ei, is computed as the linear summation of standardized fishing effort generated by each fishery j. That is, (equation omitted) where $f_{j}$ is the total vessel tonnage of fishery j and aij is the coefficients contributing to the standardized fishing effort per ton for species i taken in fishery j. The total fishing effort level on species i due to both directed fishing and by - catch can thus be accounted in the aij's. Optimal effort allocation among the j fisheries may be considered a minimizing problem (minimize $\Sigma$ $f_{j}$), subject to the constraints that standardized fishing effort levels on particular species are maintained at, above, and below certain predefined levels. Fishing effort goals for individual species can be based on various biological and/or economic criteria, i.e., fishing effort level generating maximum sustainable yield and/or maximum economic yield. But in this study the $F_{0.1}$ criteria which was accepted as an approximate level for $F_{mey}$ by Outland and Boerema's (1973) study. The findings of this study are, (1) LP model can be applied to the Korean inshore and offshore fisheries giobally. (2) Through a new way of combining multiple different fisheries' efforts for a particular species together generating standardized fishing effort, Schaefer curve could be applied to the complex system successfully. (3) The results of this study for total reduction scale were mostly the same as those of prior studies, but different much from the individual scales of reduction. This study showed the necessities for exploitation of more concrete parameters to put into consideration of profitability of fisheries and social factors, and this model can be modified according to the actual constraints. Also, considering the age structure of stocks, this model can be developed into better one for better fisheries management.ent.

• 한국산림과학회지
• /
• 제82권3호
• /
• pp.292-304
• /
• 1993

이 연구에서는 대단지 산림자원의 수확벌채계획(收穫伐採計劃) 수립을 위한 선행계획 전산모델의 기초체계를 제시하였다. 모델에서 사용한 선형계획수식화모형은 비감소수확(非減少收穫)에 허용증감율을 적용하여 목표림의 유도, 최소 목재공급의 한계 및 최대 벌채면적의 한계와 같은 산림생산 제약조건들을 포함하고 있다. 이 모델에서는 Model I 및 Model II 기법에 의한 선형계획 수식화가 가능하고, Matrix 출력은 MPS 양식에 의한다. 전산모델 개발에 있어서 선형계획기법에 의한 산림자원 경영분석방법론(經營分析方法論)의 타당성(妥當性)은 문헌고찰에 의해 이미 국내에 소개된 바 있는 감반율법(減反率法) 및 이분검색법(二分檢索法)의 해법특성(解法特性)과의 비교고찰(比較考察)을 통해 검토하였다. 또한 제시된 모델체계의 적용성은 대규모 산림자원 경영계획을 수렵하기 위한 사례분석을 통해 검토하였다. 사례분석을 위한 연구대상지로 서울대학교 남부연습림 백운산지역(약 11,000ha)을 선택하여 위에서 제시된 산림생산(山林生産) 제약인자(制約因子)들을 동시에 만족시킬 수 있는 최적벌채계획(最適伐採計劃)을 수립하고, 목재생산 제약인자들의 강도에 대한 영향력을 분석하였다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2011년도 제42회 하계학술대회
• /
• pp.240-241
• /
• 2011

풍력발전단지가 급속히 증가함에 따라 풍력발전단지의 제어를 통한 계통 규정 참여가 중요해지고 있다. 본 논문에서는 풍력발전단지 내에서의 송전손실을 최소화하기 위한 풍력발전기의 제어 방식을 제안한다. 모의 계통은 덴마크 해상풍력단지 Horns Rev를 본떴으며 풍력발전기 별로 적용되는 풍속도 Wake Effect를 고려한 실제 데이터를 사용하였다. 손실 최소화를 위해 Linear Programming(LP)에 기반을 둔Optimal Power Flow(OPF)를 사용하였다.

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

In this paper, we have proposed new solution methods to solve TSLP (two-stage stochastic linear programming) problems. One solution method is to combine the analytic center concept with Benders' decomposition strategy to solve TSLP problems. Another method is to apply an idea proposed by Geoffrion and Graves to modify the L-shaped algorithm and the analytic center algorithm. We have compared the numerical performance of the proposed algorithms to that of the existing algorithm, the L-shaped algorithm. To effectively compare those algorithms, we have had computational experiments for seven test problems.