Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs
暂无分享,去创建一个
James R. Luedtke | Shabbir Ahmed | Weijun Xie | Yongjia Song | Shabbir Ahmed | Weijun Xie | Yongjia Song
[1] M. Wagner,et al. Generalized Linear Programming Solves the Dual , 1976 .
[2] A. Charnes,et al. Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints , 1963 .
[3] Claudia A. Sagastizábal,et al. Level bundle methods for oracles with on-demand accuracy , 2014, Optim. Methods Softw..
[4] James R. Luedtke,et al. Chance-Constrained Binary Packing Problems , 2014, INFORMS J. Comput..
[5] Maria Gabriela Martinez,et al. Regularization methods for optimization problems with probabilistic constraints , 2013, Math. Program..
[6] Alexander Shapiro,et al. Lectures on Stochastic Programming: Modeling and Theory , 2009 .
[7] Matteo Fischetti,et al. On the separation of disjunctive cuts , 2011, Math. Program..
[8] Sebastián Ceria,et al. Convex programming for disjunctive convex optimization , 1999, Math. Program..
[9] Claude Lemaréchal,et al. Convex proximal bundle methods in depth: a unified analysis for inexact oracles , 2014, Math. Program..
[10] James R. Luedtke. A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support , 2013, Mathematical Programming.
[11] James R. Luedtke,et al. A Sample Approximation Approach for Optimization with Probabilistic Constraints , 2008, SIAM J. Optim..
[12] Patrizia Beraldi,et al. The Probabilistic Set-Covering Problem , 2002, Oper. Res..
[13] Claude Lemaréchal,et al. A geometric study of duality gaps, with applications , 2001, Math. Program..
[14] Egon Balas. A modified lift-and-project procedure , 1997, Math. Program..
[15] 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..
[16] Giuseppe Carlo Calafiore,et al. The scenario approach to robust control design , 2006, IEEE Transactions on Automatic Control.
[17] R. Rockafellar,et al. Nonanticipativity and L1-martingales in stochastic optimization problems , 1976 .
[18] M. Slater. Lagrange Multipliers Revisited , 2014 .
[19] James R. Luedtke,et al. Branch-and-cut approaches for chance-constrained formulations of reliable network design problems , 2013, Mathematical Programming Computation.
[20] Jie Sun,et al. An Alternating Direction Method for Chance-Constrained Optimization Problems with Discrete Distributions , 2013 .
[21] András Prékopa. Static Stochastic Programming Models , 1995 .
[22] René Henrion. A Critical Note on Empirical (Sample Average, Monte Carlo) Approximation of Solutions to Chance Constrained Programs , 2011, System Modelling and Optimization.
[23] David L. Woodruff,et al. Scalable Heuristics for a Class of Chance-Constrained Stochastic Programs , 2010, INFORMS J. Comput..
[24] Werner Römisch,et al. Duality gaps in nonconvex stochastic optimization , 2004, Math. Program..
[25] Minjiao Zhang,et al. A Branch-and-Cut Method for Dynamic Decision Making Under Joint Chance Constraints , 2014, Manag. Sci..
[26] Alexander Shapiro,et al. Sample Average Approximation Method for Chance Constrained Programming: Theory and Applications , 2009, J. Optimization Theory and Applications.
[27] Miguel A. Lejeune,et al. Pattern-Based Modeling and Solution of Probabilistically Constrained Optimization Problems , 2012, Oper. Res..
[28] Laurence A. Wolsey,et al. Covering Linear Programming with Violations , 2014, INFORMS J. Comput..
[29] Darinka Dentcheva,et al. Optimization Models with Probabilistic Constraints , 2006 .
[30] Giuseppe Carlo Calafiore,et al. Uncertain convex programs: randomized solutions and confidence levels , 2005, Math. Program..
[31] Shabbir Ahmed,et al. A scenario decomposition algorithm for 0-1 stochastic programs , 2013, Oper. Res. Lett..
[32] Dimitri J. Papageorgiou,et al. Probabilistic Set Covering with Correlations , 2013, Oper. Res..
[33] Informationstechnik Berlin,et al. Dual Decomposition in Stochastic Integer Programming , 1996 .
[34] R. Rockafellar,et al. Optimization of conditional value-at risk , 2000 .
[35] Xiao Liu,et al. Decomposition algorithms for two-stage chance-constrained programs , 2014, Mathematical Programming.
[36] Jeffrey D. Camm,et al. Cutting Big M Down to Size , 1990 .
[37] R. Rockafellar,et al. Conditional Value-at-Risk for General Loss Distributions , 2001 .
[38] Krzysztof C. Kiwiel,et al. A Proximal Bundle Method with Approximate Subgradient Linearizations , 2006, SIAM J. Optim..
[39] B. Rusten,et al. Down to size , 1999 .
[40] René Henrion,et al. A Gradient Formula for Linear Chance Constraints Under Gaussian Distribution , 2012, Math. Oper. Res..
[41] George L. Nemhauser,et al. An integer programming approach for linear programs with probabilistic constraints , 2010, Math. Program..
[42] A. Charnes,et al. Cost Horizons and Certainty Equivalents: An Approach to Stochastic Programming of Heating Oil , 1958 .
[43] Bo Zeng,et al. Strong Inequalities for Chance – Constrained Programming , 2015 .
[44] Simge Küçükyavuz,et al. On mixing sets arising in chance-constrained programming , 2012, Math. Program..