# Applying Global Optimization to a Problem in Short-Term Hydrothermal Scheduling

Conference paper

## Abstract

A method for modeling a real constrained optimization problem as a reverse convex programming problem has been developed from a new procedure of representation of a polynomial function as a difference of convex polynomials. An adapted algorithm, which uses a combined method of outer approximation and prismatical subdivisions, has been implemented to solve this problem. The solution obtained with a local optimization package is also included and their results are compared.

## Keywords

Canonical d.c. program**εapproximate**optimal solution normal subdivision rule prismatical and conical subdivision outer approximation semi-infinite program

## Preview

Unable to display preview. Download preview PDF.

## References

- Ferrer A. (2001), Representation of a polynomial function as a difference of convex polynomials, with an application,
*Lectures Notes in Economics and Mathematical Systems*, Vol. 502, pp. 189–207.Google Scholar - Gurlitz T.R. and Jacobsen S.E. (1991), On the use of cuts in reverse convex programs,
*Journal of Optimization Theory and Applications*, Vol. 68, pp. 257–274.MathSciNetCrossRefGoogle Scholar - Heredia F.J. and Nabona N. (1995), Optimum short-term hydrothermal scheduling with spinning reverse through network flows,
*IEEE Trans. on Power Systems*, Vol. 10(3), pp. 1642–1651.CrossRefGoogle Scholar - Hiriart-Urruty J.B. (1985), Generalized differentiability, duality and optimization for problems dealing with differences of convex functions,
*Lectures Notes in Economics and Mathematical Systems*, Vol. 256, pp. 27–38.MathSciNetGoogle Scholar - Horst R. and Tuy H. (1990),
*Global optimization. Deterministic approaches*, Springer-Verlag, Heidelberg.Google Scholar - Horst R., Pardalos P.M. and Thoai Ng.V. (1995),
*Introduction to global optimization*, Kluwer Academic Publishers, Dordrecht.Google Scholar - Horst R., Phong T.Q., Thoai Ng.V. and de Vries J. (1991), On solving a d.c. programming problem by a sequence of linear programs,
*Annals of Operations Research*, Vol. 25, pp. 1–18.CrossRefGoogle Scholar - Kaliski J., Haglin D., Roos C. and Terlaky T. (1997), Logarithmic barrier decomposition methods for semi-infinite programming,
*Int. Trans. Oper. Res.*, Vol. 4(4), pp. 285–303.CrossRefGoogle Scholar - Luc D.T., Martinez-Legaz J.E. and Seeger A. (1999), Least deviation decomposition with respect to a pair of convex sets,
*Journal of Convex Analysis*, Vol. 6(1), pp. 115–140.MathSciNetGoogle Scholar - Tuy H (1998),
*Convex analysis and global optimization*, Kluwer Academic Publishers, Dordrecht.Google Scholar - Zhi-Quan L., Roos C. and Terlaky T. (1999), Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming,
*Applied Numerical Mathematics*, Vol. 29, pp. 379–394.MathSciNetCrossRefGoogle Scholar

## Copyright information

© Springer Science + Business Media, Inc. 2005