Generation Dispatch with Reserve Margin Constraints Using Linear Programming
- 1 January 1981
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Apparatus and Systems
- Vol. PAS-100 (1) , 252-258
- https://doi.org/10.1109/tpas.1981.316836
Abstract
The optimal allocation of system generation to the individual units of a power system is normally done on a marginal cost basis. However, system regulation and reserve requirements' may not allow the operation of the system at this point forcing the operator to nranually move to non-optimal operation.' In this paper the cost-optimal generation allocation problem with reserve margins and other constraints is formulated as a linear programming problem. This formulation is shown to have a structure that can be decomposed into a set of smaller linear programming subproblems using the Dantzig-Wolfe method. Some unique aspects of the computer program developed to solve this problem are described together with some results using a medium-size power system. Although the program was developed to determine the cost of providing a certain level of regulation or reserve margin from off-line studies, it appears that the computer time and storage requirements are such that real-time dispatching with such a program may be feasible in a modern control centerKeywords
This publication has 6 references indexed in Scilit:
- Review Of Linear Programming Applied To Power System ReschedulingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A Real Time Optimizer for Security DispatchIEEE Transactions on Power Apparatus and Systems, 1974
- Economic Allocation of Regulating MarginIEEE Transactions on Power Apparatus and Systems, 1971
- Forecasting Minimum Production Costs with Linear ProgrammingIEEE Transactions on Power Apparatus and Systems, 1971
- The Decomposition Algorithm for Linear ProgramsEconometrica, 1961
- Decomposition Principle for Linear ProgramsOperations Research, 1960