Advertisement

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

  • Albert Ferrer
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 77)

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.

Unable to display preview. Download preview PDF.

References

  1. 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
  2. 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
  3. 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
  4. 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
  5. Horst R. and Tuy H. (1990), Global optimization. Deterministic approaches, Springer-Verlag, Heidelberg.Google Scholar
  6. Horst R., Pardalos P.M. and Thoai Ng.V. (1995), Introduction to global optimization, Kluwer Academic Publishers, Dordrecht.Google Scholar
  7. 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
  8. 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
  9. 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
  10. Tuy H (1998), Convex analysis and global optimization, Kluwer Academic Publishers, Dordrecht.Google Scholar
  11. 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

Authors and Affiliations

  • Albert Ferrer
    • 1
  1. 1.Departament de Matemàtica Aplicada IUniversitat Politècnica de CatalunyaSpain

Personalised recommendations