A solving detailed structured duals of unit commitment problems
Unit Commitment Problems concern the scheduling of power units to meet demand and reserve constraints over a short term period. We study large scale Unit Commitment Problems with quadratic costs. Dualizing the demand and reserve constraints one gets shortest path subproblems. One can moreover exploit the quadratic primal structure, to arrive at a piecewise quadratic dual. For multipliers close to optimal, however, few commitment schedules are optimal for each generating unit. {open_quotes}Restrifying{close_quotes} the primal and the dual to those commitment schedules one gets a structured dual problem with quadratic constraints. For a given set of commitment schedules, we solve this restricted dual to optimum by descent methods. Then we generate new commitment schedules, to adjoin to the set, by dolving the subproblems. In this way we can compute the dual optimum in a finite number of iterations.
- OSTI ID:
- 36225
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
A method for solving the fuel constrained unit commitment problem
Modeling transmission line constraints in two-stage robust unit commitment problem