• Title, Summary, Keyword: Linear programming (LP)

Search Result 104, Processing Time 0.033 seconds

Policy Capturing LP for Ranged Ratings in Performance Appraisal

  • Jung, Ho-Won
    • Management Science and Financial Engineering
    • /
    • v.9 no.2
    • /
    • pp.13-20
    • /
    • 2003
  • For inferring criteria in a performance appraisal. linear programming (LP) has been utilized as an alternative to policy capturing (PC). Previous policy capturing LP (PCLP) studies were limited to the criteria of exact numerical ratings. However. under certain evaluation circumstances, a ranged rating with a lower and upper bound may be preferred over an exact numerical value. Therefore, this study introduces a new LP model that allows ranged ratings. A simple example is given to illustrate our model.

An Empirical Study of Production Scheduling Model Establishment by LP Technique (LP기법에 의한 생산계획 모형수립의 실증적 연구)

  • 최원용
    • Journal of the Society of Korea Industrial and Systems Engineering
    • /
    • v.19 no.40
    • /
    • pp.203-217
    • /
    • 1996
  • This thesis describes a quantitative decision-making of production planning system. A mathmatical model of Linear Programming is used set up a production scheuling under the assumption. As the emphasis is laid on the applicability of the developed model, the linrar programming is applied to establish the production schedule for "F" furniture company which produces kitchin cabinet and OA furniture, The optimal solution is obtained by using the LP package, QBS. By the solution reduced to 14% of work force compared with the real data during all of the planning horizon. And it is also possible to reduce the work-force of the lowest level of employee by 10% for the reasonable management. There are some limitations in computerized data processing, which is only considering the economic costs without considering any external environment of case enterprise. As a result, it is shown that the LP model is very useful method of make aggregate production schedule. schedule.

  • PDF

Exploring a Hypothetical Learning Trajectory of Linear Programming by the Didactical Analysis (선형계획법의 교수학적 분석을 통한 가설 학습 경로 탐색)

  • Choi, Ji-Sun;Lee, Kyeong-Hwa;Kim, Suh-Ryung
    • Journal of Educational Research in Mathematics
    • /
    • v.20 no.1
    • /
    • pp.85-102
    • /
    • 2010
  • Linear programming(LP) is useful for finding the best way in a given condition for some list of requirements represented as linear equations. This study analysed LP in mathematics contexts and LP in school mathematics contexts, considered learning process of LP from an epistemological point of view, and explored a hypothetical learning trajectory of LP. The differences between mathematics contexts and school mathematics contexts are whether they considered that the convex polytope $\Omega$ is feasible/infeasible or bounded/unbounded or not, and whether they prove the theorem that the optimum is always attained at a vertex of the polyhedronor not. And there is a possibility that students could not understand what is maximum and minimum of a linear function when the domain of the function is limited. By considering these three aspects, we constructed hypothetical learning trajectory consisted of 4 steps. The first step is to see a given linear expression as linear function, the second step is to partition a given domain by straight lines, the third step is to construct the conception of y-intercept by relating lines and the range of k, and the forth step is to identify whether there exists the optimum in a given domain or not.

  • PDF

A LP-based Optimal Power Flow Using Multi-segment Curve Method (Multi-segment curve method를 이용한 선형계획법 기반 최적 조류계산)

  • Ha, Dong-Wan;Kim, Chang-Su;Song, Kyung-Bin;Baek, Young-Sik
    • Proceedings of the KIEE Conference
    • /
    • /
    • pp.200-202
    • /
    • 1999
  • This paper describes the optimization problem of real power rescheduling and present an algorithm based linear programming for studying the load-shedding and generation reallocation problem when a portion of the transmission system is disabled and at power flow solution cannot be obtained for the overload of some lines. And in case initial is infeasible, solution could not be converge. So this paper gives an algorithm being lie infeasible quantities within limit. The paper describes a LP-based algorithm to obtain the solution in power dispatch related to overload situations in power system and it is easily extened under various objective. The optimization procedures is based in linear programming with bounded variables and use the multi-segment curve method for a objective function and the validity of the algorithm is verified with two examples : 10-bus system and 57-bus system.

  • PDF

Interior Point Methods for Multicommodity Flow Problems (다수상품 흐름문제를 위한 내부점 방법)

  • Lim, Sung-Mook;Seol, Tong-Ryeol;Park, Soon-Dal
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.27 no.3
    • /
    • pp.274-280
    • /
    • 2001
  • In this research, we develop a specialized primal-dual interior point solver for the multicommodity flow problems (MCFP). The Castro's approach that exploits the problem structure is investigated and several aspects that must be considered in the implementation are addressed. First, we show how preprocessing techniques for linear programming(LP) are adjusted for MCFP. Secondly, we develop a procedure that extracts a network structure from the general LP formulated MCFP. Finally, we consider how the special structure of the mutual capacity constraints is exploited. Results of comupational comparison between our solver and a general interior point solver are also included.

  • PDF

A Study on the Rescheduling of Generation Considering Contingency in Power System with Wind Farms (풍력발전단지가 연계된 전력계통에서 상정고장을 고려한 발전력 재조정에 관한 연구)

  • Choi, Soo-Hyun;Kim, Kyu-Ho
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.66 no.2
    • /
    • pp.255-260
    • /
    • 2017
  • This paper studies on effective rescheduling of generation when the single line contingency has occurred in power system with wind farm. The suggested method is formulated to minimize the rescheduling cost of conventional and wind generators to alleviate congestion. The generator rescheduling method has been used with incorporation of wind farms in the power system. Since all sensitivity is different about congestion line, Line Outage Distribution Factor(LODF) and Generator Sensitivity Factor(GSF) is used to alleviate congestion. The formulation have been proccessed using linear programming(LP) optimization techniques to alleviate transmission congestion. The effectiveness of the proposed rescheduling of generation method has been analyzed on revised IEEE 30-bus systems.

The Generalized Multiple-Choice Multi-Divisional Linear Programming Knapsack Problem (일반 다중선택 다분할 선형계획 배낭문제)

  • Won, Joong-Yeon
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.40 no.4
    • /
    • pp.396-403
    • /
    • 2014
  • The multi-divisional knapsack problem is defined as a binary knapsack problem where each mutually exclusive division has its own capacity. In this paper, we present an extension of the multi-divisional knapsack problem that has generalized multiple-choice constraints. We explore the linear programming relaxation (P) of this extended problem and identify some properties of problem (P). Then, we develop a transformation which converts the problem (P) into an LP knapsack problem and derive the optimal solutions of problem (P) from those of the converted LP knapsack problem. The solution procedures have a worst case computational complexity of order $O(n^2{\log}\;n)$, where n is the total number of variables. We illustrate a numerical example and discuss some variations of problem (P).

Optimal Power Flow with Linear Programming (선형계획법을 이용한 최적조류계산)

  • Jung, G.H.;Baek, Y.S.;Song, K.B.;Chu, J.B.;Won, J.R.
    • Proceedings of the KIEE Conference
    • /
    • /
    • pp.145-148
    • /
    • 2000
  • This paper presents new algorithm which is based on LP(Linear Programming) that guarantee convergence. It is considered to minimize generation cost and load shedding as object function subject to various constraints. The proposed algorithm use sensitivity matrix to re-dispatch generation power, so the total CPU time is saved.

  • PDF

On a Two Dimensional Linear Programming Knapsack Problem with the Generalized GUB Constraint (일반화된 일반상한제약을 갖는 이차원 선형계획 배낭문제 연구)

  • Won, Joong-Yeon
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.37 no.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.

Application of Fuzzy Linear Programming to Estimate the Potentiality of Domestic Long-Term Wood Supply (국내 장기목재공급 잠재력 예측을 위한 퍼지선형계획법의 적용)

  • Won, Hyun-Kyu;Kim, Young-Hwan;Lee, Kyeong-Hak;Jang, Kwang-Min
    • Journal of Korean Society of Forest Science
    • /
    • v.99 no.6
    • /
    • pp.802-807
    • /
    • 2010
  • The objective of this study was to estimate potential of domestic long-term wood supply by using fuzzy linear programming (FLP). In order to construct a numerical formula model, maximization of total timber production was used for the objective function. Size limit of harvesting and sustained yield were used as the constraints. The results of comparison between LP and FLP were shown that LP is more suitable than FLP in terms of the amount of timber production and final forest stock. However, as long-term sustained yield was limitedly achieved by using LP, FLP was more desirable for prediction of potential wood supply. According to the results of this study, the potential of annual domestic wood supply was estimated about 10.5 million cubic meters. Gyeong buk, Jeon nam, Gangwon and Gyeong nam province were highly ranked in order of provincial potential of wood supply.