Title :
An interior-point/cutting-plane method to solve unit commitment problems
Author :
Madrigal, Marcelino ; Quintana, Victor H.
Author_Institution :
Waterloo Univ., Ont., Canada
fDate :
8/1/2000 12:00:00 AM
Abstract :
An interior-point/cutting-plane method for nondifferentiable optimization is used to solve the dual to a unit commitment problem. The interior-point/cutting-plane method has two advantages over previous approaches, such as the sub-gradient and bundle methods: first, it has better convergence characteristics; and second, does not suffer from the parameter-turning drawback. The results of a performance testing using systems with up to 104 units confirm the superiority of the interior-point/cutting-plane method over previous approaches
Keywords :
convergence; optimisation; power generation scheduling; relaxation; Lagrangian relaxation; convergence characteristics; interior-point/cutting-plane method; nondifferentiable optimization; performance testing; unit commitment; Convergence; Dynamic programming; Dynamic scheduling; Engines; Heuristic algorithms; Lagrangian functions; Optimization methods; Power engineering; Processor scheduling; System testing;
Journal_Title :
Power Systems, IEEE Transactions on
