Nonlinear chance-constrained problems with applications to hydro scheduling

We present a Branch-and-Cut algorithm for a class of nonlinear chance-constrained mathematical optimization problems with a finite number of scenarios. Unsatisfied scenarios can enter a recovery mode. This class corresponds to problems that can be reformulated as deterministic convex mixed-integer nonlinear programming problems with indicator variables and continuous scenario variables, but the size of the reformulation is large and quickly becomes impractical as the number of scenarios grows. The Branch-and-Cut algorithm is based on an implicit Benders decomposition scheme, where we generate cutting planes as outer approximation cuts from the projection of the feasible region on suitable subspaces. The size of the master problem in our scheme is much smaller than the deterministic reformulation of the chance-constrained problem. We apply the Branch-and-Cut algorithm to the mid-term hydro scheduling problem, for which we propose a chance-constrained formulation. A computational study using data from ten hydroplants in Greece shows that the proposed methodology solves instances faster than applying a general-purpose solver for convex mixed-integer nonlinear programming problems to the deterministic reformulation, and scales much better with the number of scenarios.

[1]  A. Charnes,et al.  Cost Horizons and Certainty Equivalents: An Approach to Stochastic Programming of Heating Oil , 1958 .

[2]  J. E. Kelley,et al.  The Cutting-Plane Method for Solving Convex Programs , 1960 .

[3]  A. Charnes,et al.  Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints , 1963 .

[4]  Anthony Wren Proceedings of the Princeton Symposium on Mathematical Programming , 1972 .

[5]  A. M. Geoffrion Generalized Benders decomposition , 1972 .

[6]  P. França,et al.  Solving Stochastic Transportation-Location Problems by Generalized Benders Decomposition , 1982 .

[7]  Jeremy A. Bloom,et al.  Solving an Electricity Generating Capacity Expansion Planning Problem by Generalized Benders' Decomposition , 1983, Oper. Res..

[8]  Ignacio E. Grossmann,et al.  An outer-approximation algorithm for a class of mixed-integer nonlinear programs , 1986, Math. Program..

[9]  Robert G. Jeroslow,et al.  Representability in mixed integer programmiing, I: Characterization results , 1987, Discret. Appl. Math..

[10]  Secundino Soares,et al.  A large scale of an optimal deterministic hydrothermal scheduling algorithm , 1990 .

[11]  Tamás Szántai,et al.  Stochastic programming in water management: A case study and a comparison of solution techniques , 1991 .

[12]  Giovanni Rinaldi,et al.  A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

[13]  Tsunemi Watanabe,et al.  Stochastic programming models for air quality management , 1993, Comput. Oper. Res..

[14]  Sven Leyffer,et al.  Solving mixed integer nonlinear programs by outer approximation , 1994, Math. Program..

[15]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[16]  Nikola Rajaković,et al.  A flexible approach to short-term hydro-thermal coordination. I. Problem formulation and general solution procedure , 1996 .

[17]  Iiro Harjunkoski,et al.  An extended cutting plane method for a class of non-convex MINLP problems , 1998 .

[18]  H.-C. Chang,et al.  Hydrothermal generation scheduling package: a genetic based approach , 1998 .

[19]  Md. Sayeed Salam,et al.  Hydrothermal scheduling based Lagrangian relaxation approach to hydrothermal coordination , 1998 .

[20]  G. Nemhauser,et al.  The mixed vertex packing problem , 2000 .

[21]  Martin W. P. Savelsbergh,et al.  The mixed vertex packing problem , 2000, Math. Program..

[22]  Claude Lemaréchal,et al.  Bundle Methods in Stochastic Optimal Power Management: A Disaggregated Approach Using Preconditioners , 2001, Comput. Optim. Appl..

[23]  Oktay Günlük,et al.  Mixing mixed-integer inequalities , 2001, Math. Program..

[24]  Shabbir Ahmed,et al.  On robust optimization of two-stage systems , 2004, Math. Program..

[25]  Lorenz T. Biegler,et al.  On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming , 2006, Math. Program..

[26]  Matteo Fischetti,et al.  Combinatorial Benders' Cuts for Mixed-Integer Linear Programming , 2006, Oper. Res..

[27]  M.E.P. Maceira,et al.  Improvement in the Hydro Plants Production Function for the Mid-Term Operation Planning Model in Hydrothermal Systems , 2008 .

[28]  M.E.P. Maceira,et al.  A Four-Dimensional Model of Hydro Generation for the Short-Term Hydrothermal Dispatch Problem Considering Head and Spillage Effects , 2008, IEEE Transactions on Power Systems.

[29]  James R. Luedtke,et al.  A Sample Approximation Approach for Optimization with Probabilistic Constraints , 2008, SIAM J. Optim..

[30]  Matthew W. Tanner,et al.  Finding optimal vaccination strategies under parameter uncertainty using stochastic programming. , 2008, Mathematical biosciences.

[31]  Gérard Cornuéjols,et al.  An algorithmic framework for convex mixed integer nonlinear programs , 2008, Discret. Optim..

[32]  Gérard Cornuéjols,et al.  A Feasibility Pump for mixed integer nonlinear programs , 2009, Math. Program..

[33]  Leo Liberti,et al.  Branching and bounds tighteningtechniques for non-convex MINLP , 2009, Optim. Methods Softw..

[34]  Sven Leyffer,et al.  FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs , 2010, INFORMS J. Comput..

[35]  René Henrion,et al.  A model for dynamic chance constraints in hydro power reservoir management , 2010, Eur. J. Oper. Res..

[36]  Matteo Fischetti,et al.  A note on the selection of Benders’ cuts , 2010, Math. Program..

[37]  A. Bakirtzis,et al.  Mid-Term Stochastic Scheduling of a Price-Maker Hydro Producer With Pumped Storage , 2011, IEEE Transactions on Power Systems.

[38]  Yongpei Guan,et al.  A Chance-Constrained Two-Stage Stochastic Program for Unit Commitment With Uncertain Wind Power Output , 2012 .

[39]  Miguel A. Lejeune,et al.  Pattern-Based Modeling and Solution of Probabilistically Constrained Optimization Problems , 2012, Oper. Res..

[40]  Jitka Dupacová,et al.  Approximation and contamination bounds for probabilistic programs , 2012, Ann. Oper. Res..

[41]  R. Henrion,et al.  Joint chance constrained programming for hydro reservoir management , 2013 .

[42]  Dinakar Gade,et al.  Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs , 2012, Mathematical Programming.

[43]  James R. Luedtke,et al.  Chance-Constrained Binary Packing Problems , 2014, INFORMS J. Comput..

[44]  Laurence A. Wolsey,et al.  Covering Linear Programming with Violations , 2014, INFORMS J. Comput..

[45]  Wim van Ackooij,et al.  Decomposition approaches for block-structured chance-constrained programs with application to hydro-thermal unit commitment , 2014, Math. Methods Oper. Res..

[46]  James R. Luedtke A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support , 2013, Mathematical Programming.

[47]  Pierre Bonami,et al.  On mathematical programming with indicator constraints , 2015, Math. Program..

[48]  Alexander J. McNeil,et al.  Quantitative Risk Management: Concepts, Techniques and Tools Revised edition , 2015 .

[49]  Antonio Frangioni,et al.  Large-scale Unit Commitment under uncertainty , 2014, 4OR.

[50]  András Prékopa,et al.  ON PROBABILISTIC CONSTRAINED PROGRAMMING , 2015 .

[51]  Xiao Liu,et al.  Decomposition algorithms for two-stage chance-constrained programs , 2014, Mathematical Programming.

[52]  François Margot,et al.  Solving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities , 2016, Oper. Res..

[53]  Marek Nagy,et al.  [Online First]. , 2016, Pflege.

[54]  Martin Branda,et al.  Nonlinear Chance Constrained Problems: Optimality Conditions, Regularization and Solvers , 2016, Journal of Optimization Theory and Applications.