Optimal short-term scheduling of large-scale power systems

This paper is concerned with the long-standing problem of optimal unit commitment in an electric power system. We follow the traditional formulation of this problem which gives rise to a large-scale, dynamic, mixed-integer programming problem. We describe a solution methodology based on duality, Lagrangian relaxation, and nondifferentiable optimization that has two unique features. First, computational requirements typically grow only linearly with the number of generating units. Second, the duality gap decreases in relative terms as the number of units increases, and as a result our algorithm tends to actually perform better for problems of large size. This allows for the first time consistently reliable solution of large practical problems involving several hundreds of units within realistic time constraints. Aside from the unit commitment problem, this methodology is applicable to a broad class of large-scale dynamic scheduling and resource allocation problems involving integer variables.

[1]  Boris Polyak Minimization of unsmooth functionals , 1969 .

[2]  B. T. Polyak The convergence rate of the penalty function method , 1971 .

[3]  D. Bertsekas,et al.  A new penalty function method for constrained minimization , 1972, CDC 1972.

[4]  D. Bertsekas,et al.  A DESCENT NUMERICAL METHOD FOR OPTIMIZATION PROBLEMS WITH NONDIFFERENTIABLE COST FUNCTIONALS , 1973 .

[5]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[6]  Philip Wolfe,et al.  Note on a method of conjugate subgradients for minimizing nondifferentiable functions , 1974, Math. Program..

[7]  Claude Lemaréchal,et al.  An Algorithm for Minimizing Convex Functions , 1974, IFIP Congress.

[8]  P. Wolfe Note on a method of conjugate subgradients for minimizing nondifferentiable functions , 1974 .

[9]  N. Z. Shor Convergence of a gradient method with space dilation in the direction of the difference between two successive gradients , 1975 .

[10]  D. Bertsekas Nondifferentiable optimization via approximation , 1975 .

[11]  Robert Mifflin,et al.  An Algorithm for Constrained Optimization with Semismooth Functions , 1977, Math. Oper. Res..

[12]  A. A. Goldstein,et al.  Optimization of lipschitz continuous functions , 1977, Math. Program..

[13]  D. Bertsekas Approximation procedures based on the method of multipliers , 1977 .

[14]  John A. Muckstadt,et al.  An Application of Lagrangian Relaxation to Scheduling in Power-Generation Systems , 1977, Oper. Res..

[15]  J. Strodiot,et al.  On the convergence rate for a penalty function method of exponential type , 1979 .

[16]  Godwin C. Ovuworie,et al.  Mathematical Programming: Structures and Algorithms , 1979 .

[17]  D. Bertsekas Projected Newton methods for optimization problems with simple constraints , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[18]  D. Bertsekas,et al.  Estimates of the duality gap for large-scale separable nonconvex optimization problems , 1982, 1982 21st IEEE Conference on Decision and Control.

[19]  Claude Lemaréchal,et al.  Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions , 1982, Math. Program..

[20]  D. Bertsekas,et al.  Solution of Large-Scale Optimal Unit Commitment Problems , 1982, IEEE Transactions on Power Apparatus and Systems.