Abstract
Unit commitment in production planning of power systems involves dynamic, mixed-integer programming problems. We show that specialized bundle methods applied to Lagrangian relaxations provide not only lower bounds on the optimal value (as do subgradient methods), but also certain relaxed primal solutions. These solutions can be used for constructing good primal feasible solutions. We present computational experience for large-scale examples.
the Swedish Research Council for Engineering Sciences, the Göran Gustafsson Foundation and the Polish Academy of Sciences.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. F. Bard, Short-term scheduling of thermal-electric generators using Lagrangian relaxation, Oper. Res. 36 (1988) 756–766.
D. P. Bertsekas, Constrained Optimization and Lagrange Multiplier Methods, Academic Press, New York, 1982.
D. Bertsekas, G. S. Lauer, N. R. Sandell and T. A. Posberg, Optimal short-term scheduling of large-scale power systems, IEEE Trans. Automat. Control AC-28 (1983) 1–11.
S. Feltenmark and K. C. Kiwiel, Lagrangian relaxation of nonconvex problems via bundle methods, Report TRITA/MAT-96-OS3, Department of Mathematics, Royal Institute of Technology, Stockholm, April 1996.
J.-B. Hiriart-Urruty and C. Lemaréchal, Convex Analysis and Minimization Algorithms, Springer-Verlag, Berlin, 1993.
K. C. Kiwiel, Proximity control in bundle methods for convex nondifferentiable minimization, Math. Programming 46 (1990) 105–122.
K. C. Kiwiel, A Cholesky dual method for proximal piecewise linear programming, Numer. Math. 68 (1994) 325–340.
K. C. Kiwiel, Approximations in proximal bundle methods and decomposition of convex programs, J. Optim. Theory Appl. 84 (1995) 529–548.
C. Li, R. B. Johnson and A. J. Svoboda, A new unit commitment method, Tech. report, IEEE Winter Meeting, 1996.
C. Lemaréchal, F. Pellegrino, A. Renaud and C. Sagastizábal, Bundle methods applied to the unit- commitment problem, in System Modelling and Optimization, Proceedings of the Seventeenth IFIP TC7 Conference on System Modelling and Optimization, 1995, J. Dolezal and J. Fidler, eds., Chapman & Hall, London, 1996, pp. 395–402.
A. Möller and W. Römisch, A dual method for the unit commitment problem, Tech. report, Institut für Mathematik, Humboldt-Univ. Berlin, Berlin, Germany, 1994.
J. A. Muckstadt and S. A. Koenig, An application of Lagrangian relaxation to scheduling in thermal power-generation systems, Oper. Res. 25 (1977) 387–403.
J. F. Shapiro, Mathematical Programming: Structures and Algorithms, Wiley, New York, 1979.
B. Sheble and G. N. Fahd, Unit commitment literature synopsis, IEEE Trans. Power Systems 9 (1994) 128–135.
W. Zeminger, A. J. Wood, H. K. Clark, T. F. Laskowski and J. D. Bums, Synthetic electric utility systems for evaluating advanced technologies, Final Rep. EM-285, Electrical Power Research Institute (EPRI), 1977.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Feltenmark, S., Kiwiel, K.C., Lindberg, PO. (1997). Solving Unit Commitment Problems in Power Production Planning. In: Operations Research Proceedings 1996. Operations Research Proceedings, vol 1996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60744-8_43
Download citation
DOI: https://doi.org/10.1007/978-3-642-60744-8_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62630-5
Online ISBN: 978-3-642-60744-8
eBook Packages: Springer Book Archive