• 제목, 요약, 키워드: Linear programming (LP)

검색결과 104건 처리시간 0.051초

Problem Solution of Linear Programming based Neural Network

  • 손준혁;서보혁
    • 대한전기학회:학술대회논문집
    • /
    • /
    • pp.98-101
    • /
    • 2004
  • Linear Programming(LP) is the term used for defining a wide range of optimization problems in which the objective function to be minimized or maximized is linear in the unknown variables and the constraints are a combination of linear equalities and inequalities. LP problems occur in many real-life economic situations where profits are to be maximized or costs minimized with constraint limits on resources. While the simplex method introduced in a later reference can be used for hand solution of LP problems, computer use becomes necessary even for a small number of variables. Problems involving diet decisions, transportation, production and manufacturing, product mix, engineering limit analysis in design, airline scheduling, and so on are solved using computers. This technique is called Sequential Linear Programming (SLP). This paper describes LP's problems and solves a LP's problems using the neural networks.

  • PDF

Linear Programming에 의한 삼림경영계획(森林經營計劃) - 잣나무임분(林分)의 삼림수확계획(森林收穫計劃)을 중심으로 - (Forest Management Planning by Linear Programming - Timber Harvest Scheduling of a Korean Pine stand -)

  • 우종춘
    • 한국산림과학회지
    • /
    • v.80 no.4
    • /
    • pp.427-435
    • /
    • 1991
  • 삼림수확계획(森林收穫計劃)을 위한 선형계획법(線型計劃法)(LP)의 적용성(適用性)은 이미 널리 알려져 있다. 본 연구(硏究)에서는 삼림경영(森林經營) 계획기간(計劃期間) 10년 동안 보적수확량(保積收穫量)의 시간적(時間的), 공간적(空間的) 최적배분(最適配分)을 위하여 시뮬레이션과 선형계획법(線型計劃法)을 사용하였다. 수확표수치(收穫表數値)를 이용하여 수종별(樹種別) 생장방정식(生長方程式)을 유도했고 시뮬레이션 모형(模型)에 유도된 생장방정식(生長方程式)을 포함시켜 계획기간(計劃期間)동안 잣나무임분(林分)의 축적변동상황(蓄積變動狀況)을 추정(推定)하였다. 이것은 LP모형의 기초 data가 되며 고전적(古典的) 수확조절방법(收穫調節方法)(Paulsen-Hundeshagen 공식법(公式法))에 의해 계산된 분기별(分期別) 수확재적(收穫材積)의 상한치(上限値)등이 LP모형구성에 포함되었다. 2년(年)을 1분기(分期)로 하여 계획기간(計劃期間) 10년(年)을 5분기(分期)로 나누었으며 본(本) 연구(硏究)에서 개발(開發)된 LP모형에 의해 연습림내(演習林內) 잣나무 임분(林分)의 보조소반별(補助小班別) 분기별(分期別) 최적수확(最適收穫) 계획(計劃)을 수립(樹立)하였다.

  • PDF

Deformable Surface 3D Reconstruction from a Single Image by Linear Programming

  • Ma, Wenjuan;Sun, Shusen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.6
    • /
    • pp.3121-3142
    • /
    • 2017
  • We present a method for 3D shape reconstruction of inextensible deformable surfaces from a single image. The key of our approach is to represent the surface as a 3D triangulated mesh and formulate the reconstruction problem as a sequence of Linear Programming (LP) problems. The LP problem consists of data constraints which are 3D-to-2D keypoint correspondences and shape constraints which are designed to retain original lengths of mesh edges. We use a closed-form method to generate an initial structure, then refine this structure by solving the LP problem iteratively. Compared with previous methods, ours neither involves smoothness constraints nor temporal consistency, which enables us to recover shapes of surfaces with various deformations from a single image. The robustness and accuracy of our approach are evaluated quantitatively on synthetic data and qualitatively on real data.

Analysis of the Methodology for Linear Programming Optimality Analysis using Metamodelling Techniques

  • Lee, Young-Hae;Jeong, Chan-Seok
    • 한국국방경영분석학회지
    • /
    • v.25 no.2
    • /
    • pp.1-14
    • /
    • 1999
  • Metamodels using response surface methodology (RSM) are used for the optimality analysis of linear programming (LP). They have the form of a simple polynomial, and predict the optimal objective function value of an LP for various levels of the constraints. The metamodelling techniques for optimality analysis of LP can be applied to large-scale LP models. What is needed is some large-scale application of the techniques to verify how accurate they are. In this paper, we plan to use the large scale LP model, strategic transport optimal routing model (STORM). The developed metamodels of the large scale LP can provide some useful information.

  • PDF

MS-DOS용 선형계획법 통합환경 소프트웨어의 개발 (Development of an LP integrated environment software under MS-DOS)

  • 설동렬;박찬규;서용원;박순달
    • 경영과학
    • /
    • v.12 no.1
    • /
    • pp.125-138
    • /
    • 1995
  • This paper is to develop an integrated environment software on MS-DOS for linear programming. For the purpose, First, the linear programming integrated environment software satisfying both the educational purpose and the professional purpose was designed and constructed on MS-DOS. Second, the text editor with big capacity was developed. The arithmetic form analyser was also developed and connected to the test editor so that users can input data in the arithmetic form. As a result, users can learn and perform linear programming in the linear programming integrated environment software.

  • PDF

선형계획법을 이용한 관리회계적 의사결정 (Linear Programming Applications to Managerial Accounting Decision Makings)

  • 송한식;최민철
    • 아태비즈니스연구
    • /
    • v.9 no.4
    • /
    • pp.99-117
    • /
    • 2018
  • This study has investigated Linear Programming (LP) applications to special decision making problems in managerial accounting with the help of spreadsheet Solver tools. It uses scenario approaches to case examples having three products and three resources in make-and-supply business operations, which is applicable to cases having more variables and constraints. Integer Programmings (IP) are applied in order to model situations when products are better valued in integer values or logical constraints are required. Three cases in one-time-only special order decisions include Goal Programming approach, Knapsack problems with 0/1 selections, and fixed-charge 0/1 integer modelling techniques for set-up operation costs. For the decisions in outsourcing problems, opportunity-costs of resources expressed by shadow-prices are considered to determine their precise contributions. It has also shown that the improvement in work-shop operation for an unprofitable product must overcome its 'reduced cost' by the sum of direct manufacturing cost savings and its shadow-price contributions. This paper has demonstrated how various real situations of special decision problem in managerial accounting can be approached without mistakes by using LP's and IP's, and how students both in accounting and management science can acquire LP skills in their education.

온실가스감축정책 평가를 위한 LP기반 상향식 모형의 수리 구조 및 정식화에 대한 연구 (A Mathematical Structure and Formulation of Bottom-up Model based on Linear Programming)

  • 김후곤
    • 에너지공학
    • /
    • v.23 no.4
    • /
    • pp.150-159
    • /
    • 2014
  • 2020년을 목표로 한 국내 중기 온실가스 감축목표가 2009년에 발표된 이후 다양한 온실가스 방안들이 제시되고 있다. 장기적인 온실가스 감축 정책들을 체계적으로 평가하기 위해 대부분의 국가에서는 상향식 모형 또는 하향식 모형이 이용이 되고 있다. 본 연구에서는 상향식 모형의 일반적인 현황 및 적용방안에 대해서 알아보고, 또한 가장 많이 사용되는 LP를 이용한 상향식 모형에 대한 이론적 고찰을 수행하였다. 특히 새롭게 제시된 단순화된 LP 정식화를 제시하기 위해, 의사결정변수 분석, 목적함수에 대한 분석, 기본적인 제약식인 흐름보존제약 및 용량제약에 대한 보다 간결한 정식화를 제시하고 있으며, 다양한 시나리오나 정책의 효과를 LP에 포함시킬 수 있도록 선형제약식을 만드는 방법도 제시하고 있다.

분할기법(分割技法)을 이용한 선형계획법(線型計劃法)의 응용(應用)에 관한 사례 연구(事例 硏究) (A Case Study on the Application of Decomposition Principle to a Linear Programming Problem)

  • 윤인중;김성인
    • 산업공학
    • /
    • v.1 no.1
    • /
    • pp.1-7
    • /
    • 1988
  • This paper discusses the applicability of the decomposition principle to an LP (Linear Programming) problem. Through a case study on product mix problems in a chemical process of Korean Steel Chemical Co., Ltd., the decomposition algorithm, LP Simplex method and a modified method are compared and evaluated in computation time and number of iterations.

  • PDF

불분명한 북표계확볍과 그 확장 (On Solving the Fuzzy Goal Programming and Its Extension)

  • 정충영
    • 한국경영과학회지
    • /
    • v.11 no.2
    • /
    • pp.79-87
    • /
    • 1986
  • This paper illustrates a new method to solve the fuzzy goal programming (FGP) problem. It is proved that the FGP proposed by Narasimhan can be solved on the basis of linear programming(LP) model. Narasimhan formulated the FGP problem as a set of $S^{K}$LP problems, each containing 3K constraints, where K is the number of fuzzy goals/constraints. Whereas Hanna formulated the FGP problem as a single LP problem with only 2K constraints and 2K + 1 additional variables. This paper presents that the FGP problem can be transformed with easy into a single LP model with 2K constraints and only one additional variables. And we propose extended FGP :(1) FGP with weights associated with individual goals, (2) FGP with preemptive prioities. The extended FGP has a framework that is identical to that of conventional goal programming (GP), such that the extended FGP can be applied with fuzzy concept to the all areas where GP can be applied.d.

  • PDF

삼림경영계획(森林經營計劃)을 위한 새로운 접근법(接近法) : 퍼지 다목표선형계획법(多目標線型計劃法) (A New Approach for Forest Management Planning : Fuzzy Multiobjective Linear Programming)

  • 우종춘
    • 한국산림과학회지
    • /
    • v.83 no.3
    • /
    • pp.271-279
    • /
    • 1994
  • 본(本) 논문(論文)에서는 인공조림임분경영계획(人工造林林分經營計劃) 문제를 해결하기 위하여 임업(林業)에서 최근 새롭게 적용되고 있는 퍼지 다목표(多目標) 선형계획법(線型計劃法)을 소개한다. 우선 퍼지 집합이론(集合理論)이 간략하게 설명되고 퍼지 선형계획법(線型計劃法) 및 퍼지 다목표 선형계획법이 개념적으로 소개된다. 그 다음 연구대상지역의 자료를 분석하여 표준적(標準的) 선형계획(線型計劃)모델이 구성되고 이 모델의 컴퓨터 계산에 의해 4개의 목재가격(木材價格) 범위에 대한 최적해(最適解)(순현재가(純現在價))가 각각 계산된다. 이 선형계획모델은 불확실한 4개의 목재가격정보를 조정하기 위해서 퍼지 다목표(多目標) 선형계획(線型計劃)모델로 재구성된다. 그리고 이 퍼지 모델의 계산에 의해 절충최적해(折衷最適解)가 얻어지게 된다. 4개의 목재가격 범위에 대해 얻어진 4개의 최적해와 하나의 절충최적해가 비교(比較)되고 논의(論議)된다.

  • PDF