Abstract
We discuss the energy generation expansion planning with environmental constraints, formulated as a nonsmooth convex constrained optimization problem. To solve such problems, methods suitable for constrained nonsmooth optimization need to be employed. We describe a recently developed approach, which applies the usual unconstrained bundle techniques to a dynamically changing “improvement function”. Numerical results for the generation expansion planning are reported.
Similar content being viewed by others
References
Avetisyan M, Bayless D, Gnuni T (2006) Optimal expansion of a developing power system under the conditions of market economy and environmental constraints. Energy Econ 28: 455–466
Bienstock D, Shapiro J (1988) Optimizing resource acquisition decisions by stochastic programming. Manag Sci 34(7): 215–229
Bonnans JF, Gilbert JCh, Lemaréchal C, Sagastizábal C (2006) Numerical optimization: theoretical and practical aspects, 2nd edn. Springer, Berlin
Campodónico N, Binato S, Kelman R, Pereira M, Tinoco M, Montoya F, Zhang M, Mayaki F (2003) Expansion planning of generation and interconnections under uncertainty. http://www.psr-inc.com.br/app/publicacoes.aspx#
Correa R, Lemaréchal C (1993) Convergence of some algorithms for convex minimization. Math Program 62: 261–275
Fábián C (2000) Bundle-type methods for inexact data. Central Eur J Oper Res 8: 35–55
Fábián C (2008) Handling CVaR objectives and constraints in two-stage stochastic models. Eur J Oper Res 191: 888–911
Fletcher R, Leyffer S (1999) A bundle filter method for nonsmooth nonlinear optimization. Numerical Analysis Report NA/195, Department of Mathematcs, The University of Dundee, Scotland
Hiriart-Urruty J-B, Lemaréchal C (1993) Convex analysis and minimization algorithms. Number 305-306 in Grund. der math. Wiss. Springer (two volumes)
Karas E, Ribeiro A, Sagastizábal C, Solodov M (2009) A bundle-filter method for nonsmooth convex constrained optimization. Math Program 116: 297–320
Kiwiel KC (1985) Methods of descent for nondifferentiable optimization. Lecture Notes in Mathematics, vol 1133. Springer, Berlin
Kiwiel KC (1991) Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization. Math Program 52: 285–302
Lemaréchal C, Nemirovskii A, Nesterov Yu (1995) New variants of bundle methods. Math Program 69: 111–148
Marcato R, Sagastizábal C (2007) Introducing environmental constraints in generation expansion problems. Numer Linear Algebra Appl 14: 357–368
Mifflin R (1982) A modification and extension of Lemaréchal’s algorithm for nonsmooth minimization. Math Program Stud 17: 77–90
Mifflin R (1996) A quasi-second-order proximal bundle algorithm. Math Program 73: 51–72
Sagastizábal C, Solodov MV (2005) An infeasible bundle method for nonsmooth convex constrained optimization without a penalty function or a filter. SIAM J Optim 16: 146–169
Schramm H, Zowe J (1992) A version of the bundle idea for minimizing a nonsmooth function: Conceptual idea, convergence analysis, numerical results. SIAM J Optim 2: 121–152
Author information
Authors and Affiliations
Corresponding author
Additional information
C. Sagastizábal is on leave from INRIA Rocquencourt, France.
C. Sagastizábal’s research was partially supported by CNPq Grant No. 300345/2008-9, FAPERJ and PRONEX-Optimization. M. Solodov’s research was partially supported by CNPq Grant 300513/2008-9, FAPERJ and PRONEX-Optimization.
Rights and permissions
About this article
Cite this article
Sagastizábal, C., Solodov, M. Solving generation expansion planning problems with environmental constraints by a bundle method. Comput Manag Sci 9, 163–182 (2012). https://doi.org/10.1007/s10287-012-0139-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10287-012-0139-1