• 제목/요약/키워드: Linear Programming(LP)

검색결과 117건 처리시간 0.022초

선형계획법을 이용한 양방향입찰시장에서의 제약급전계획 연구 (A Study on the Constrained Dispatch Scheduling Using Linear Programming for TWBP)

  • 김광원;이종배;정정원
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제53권10호
    • /
    • pp.573-580
    • /
    • 2004
  • A new real-time constrained dispatch scheduling (CDS) is needed for TWBP. The CDS needs to be performed at every dispatch period to decide generation power of scheduling generators and amounts of scheduling load. Therefore, the CDS is not based on real generation costs but on bidding data of market participants with some constraints such as power balance, generation limits, ancillary service, and transmission line limits. This paper selects linear programming(LP) as an optimization tool for the CDS and presents effective formulae for the LP application. This paper also presents the way of minimizing the number of variables and constraints of the LP to improve real-time applicability.

Fuzzy-LP와 GIS의 결합을 통한 토지의 최적 이용문제 (Optimized Land Use by Integrated Use of Fuzzy-LP and GIS)

  • 전철민
    • 한국측량학회지
    • /
    • 제20권3호
    • /
    • pp.273-282
    • /
    • 2002
  • GIS는 다양한 영역에서 유용한 도구로서 자리잡고 있으나, 한편으로는, 복잡한 문제를 해결하기 위해서는 GIS가 수학, 공학적인 모델링툴과 결합되는 것이 필요하다는 견해와 연구결과가 등장하고 있다. LP(Linear Programming)는 주어진 자원을 최적으로 배분하는 문제에 사용되는 수학적인 기법이다. LP는 공간적인 표현을 포함하지 않기때문에 GIS의 기능들과 결합될 때 그 유용성이 높아질 수 있다. 그러나 전통적인 LP는 명료하게 조건이 주어질 경우에만 적합한 방법이므로, 토지이용계획과 같이 결정요소가 명확한 값으로 주어질 수 없는 경우에는 현실적으로 적용하기 어려워진다. 이 연구에서는, 이와 같이 불명료한(fuzzy) 상황을 다루기 위해 Fuzzy logic을 사용한 fuzzy-LP를 개발하고, 이를 GIS와 통합하는 방법론을 제시한다. 통합시스템에서 GIS는 Fuzzy-LP과정으로 데이터를 공급하거나 Fuzzy-LP의 결과값을 표현하는데 이용된다. 이 시스템을 토지이용배분문제에 적용하는 경우를 예시하였다.

Policy Capturing LP for Ranged Ratings in Performance Appraisal

  • Jung, Ho-Won
    • Management Science and Financial Engineering
    • /
    • 제9권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.

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

  • 최원용
    • 산업경영시스템학회지
    • /
    • 제19권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)

  • 최지선;이경화;김서령
    • 대한수학교육학회지:수학교육학연구
    • /
    • 제20권1호
    • /
    • pp.85-102
    • /
    • 2010
  • 선형계획법은 일정한 조건아래 여러 가지 가능성 중에서 최적의 경우를 찾아낼 때에 유용하다. 본 연구에서는 수학적 맥락과 학교수학의 맥락에서 선형계획법을 분석하고, 인식론적 관점에서 선형계획법의 학습 과정을 살펴봄으로써, 가설 학습 경로를 탐색하였다. 수학적 맥락과 학교수학의 맥락의 차이는 주어진 영역이 실현 가능한지 또는 유계인지를 다루는가의 여부, 주어진 영역 속의 점 중에서 제한된 개수의 점만을 대입해도 최적해를 구할 수 있다는 정리의 정당화를 다루는가의 여부에 있었다. 그리고 학생들이 정의역이 제한된 경우에 이원일차함수의 최댓값과 최솟값이 무엇인지를 이해하지 못할 가능성이 있었다. 이 세 가지 측면을 인식론적 관점에서 고려하여 가설 학습 경로를 4단계 즉, 주어진 일차식이 함수식임을 이해하는 단계, 부등식 영역과 일차식을 목적함수와 관련시킴으로써 부등식 영역을 직선으로 분할하는 단계, 직선의 그래프와 k의 범위를 관계시켜 y절편의 개념을 구성하는 단계, 주어진 영역에서 최적해의 존재가능성을 확인하는 단계로 구성하였다.

  • PDF

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

  • 정경호;백영식;송경빈;추진보;원종률
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2000년도 추계학술대회 논문집 학회본부 A
    • /
    • 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

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

  • 임성묵;설동렬;박순달
    • 대한산업공학회지
    • /
    • 제27권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

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

  • 하동완;김창수;송경빈;백영식
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1999년도 추계학술대회 논문집 학회본부 A
    • /
    • 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

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

  • 최수현;김규호
    • 전기학회논문지
    • /
    • 제66권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)

  • 원중연
    • 대한산업공학회지
    • /
    • 제40권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).