Robust linear optimization with recourse: Solution methods and other properties

[1]  Fernando Ordóñez,et al.  Robust capacity expansion of network flows , 2007, Networks.

[2]  Alper Atamtürk,et al.  Two-Stage Robust Network Flow and Design Under Demand Uncertainty , 2007, Oper. Res..

[3]  Melvyn Sim,et al.  The Price of Robustness , 2004, Oper. Res..

[4]  Allen L. Soyster,et al.  Technical Note - Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming , 1973, Oper. Res..

[5]  R. Tütüncü,et al.  Adjustable Robust Optimization Models for a Nonlinear Two-Period System , 2008 .

[6]  Robert M. Freund,et al.  Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm , 1999, SIAM J. Optim..

[7]  Javier Peña,et al.  On the block-structured distance to non-surjectivity of sublinear mappings , 2005, Math. Program..

[8]  A. Ben-Tal,et al.  Adjustable robust solutions of uncertain linear programs , 2004, Math. Program..

[9]  Sharon Filipowski,et al.  On the complexity of solving feasible systems of linear inequalities specified with approximate data , 1995, Math. Program..

[10]  Fernando Ordóñez,et al.  Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization , 2003, SIAM J. Optim..

[11]  Donald Goldfarb,et al.  Robust convex quadratically constrained programs , 2003, Math. Program..

[12]  J. Renegar.  Some perturbation theory for linear programming , 1994, Math. Program..

[13]  S. Janson,et al.  Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2011 .

[14]  James Renegar,et al.  Linear programming, complexity theory and elementary functional analysis , 1995, Math. Program..

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

[16]  Arkadi Nemirovski,et al.  Robust Truss Topology Design via Semidefinite Programming , 1997, SIAM J. Optim..

[17]  Dimitris Bertsimas,et al.  A Robust Optimization Approach to Inventory Theory , 2006, Oper. Res..

[18]  G. Nemhauser,et al.  Integer Programming , 2020 .

[19]  Daniel Bienstock,et al.  Computing robust basestock levels , 2008, Discret. Optim..

[20]  John N. Tsitsiklis,et al.  Introduction to linear optimization , 1997, Athena scientific optimization and computation series.

[21]  Arkadi Nemirovski,et al.  Robust Convex Optimization , 1998, Math. Oper. Res..

[22]  Fernando Ordóñez,et al.  On an Extension of Condition Number Theory to Nonconic Convex Optimization , 2005, Math. Oper. Res..

[23]  Jorge R. Vera.  Ill-Posedness and the Complexity of Deciding Existence of Solutions to Linear Programs , 1996, SIAM J. Optim..

[24]  Robert M. Freund,et al.  Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system , 2000, Math. Program..

[25]  Carl D. Meyer,et al.  Matrix Analysis and Applied Linear Algebra , 2000 .

[26]  Arkadi Nemirovski,et al.  On Approximate Robust Counterparts of Uncertain Semidefinite and Conic Quadratic Programs , 2001, System Modelling and Optimization.

[27]  Robert M. Freund,et al.  On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System , 2003, Math. Oper. Res..

[28]  Kees Roos,et al.  Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems , 2002, SIAM J. Optim..

[29]  Yurii Nesterov,et al.  Complexity estimates of some cutting plane methods based on the analytic barrier , 1995, Math. Program..

[30]  Felipe Cucker,et al.  Solving linear programs with finite precision: II. Algorithms , 2006, J. Complex..

[31]  Yinyu Ye,et al.  Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems , 1996, SIAM J. Optim..

[32]  Sharon Filipowski.  On the Complexity of Solving Sparse Symmetric Linear Programs Specified with Approximate Data , 1997, Math. Oper. Res..

[33]  Felipe Cucker,et al.  Solving linear programs with finite precision: I. Condition numbers and random programs , 2004, Math. Program..

[34]  Tara L. Terry,et al.  Robust Linear Optimization With Recourse , 2009 .

[35]  George B. Dantzig,et al.  Linear Programming Under Uncertainty , 2004, Manag. Sci..

[36]  Pravin M. Vaidya,et al.  A cutting plane algorithm for convex programming that uses analytic centers , 1995, Math. Program..

[37]  Robert M. Freund,et al.  Condition measures and properties of the central trajectory of a linear program , 1998, Math. Program..

[38]  Melvyn Sim,et al.  Tractable Approximations to Robust Conic Optimization Problems , 2006, Math. Program..

[39]  James Renegar,et al.  Incorporating Condition Measures into the Complexity Theory of Linear Programming , 1995, SIAM J. Optim..

[40]  Felipe Cucker,et al.  A new condition number for linear programming , 2001, Math. Program..

[41]  Kim-Chuan Toh,et al.  Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems , 2007, Math. Program..

[42]  Stephen P. Boyd,et al.  Cutting-set methods for robust convex optimization with pessimizing oracles , 2009, Optim. Methods Softw..

[43]  Robert M. Freund,et al.  Some characterizations and properties of the “distance to ill-posedness” and the condition measure of a conic linear system , 1999, Math. Program..

[44]  D. Bienstock.  Experiments in Robust Portfolio Optimization , 2007 .

[45]  Arkadi Nemirovski,et al.  Robust solutions of Linear Programming problems contaminated with uncertain data , 2000, Math. Program..

[46]  Jacques F. Benders,et al.  Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..

[47]  S. Henderson,et al.  Robust optimization for intensity modulated radiation therapy treatment planning under uncertainty , 2005, Physics in medicine and biology.

[48]  Laurent El Ghaoui,et al.  Robust Solutions to Uncertain Semidefinite Programs , 1998, SIAM J. Optim..

[49]  Arkadi Nemirovski,et al.  Robust solutions of uncertain linear programs , 1999, Oper. Res. Lett..

[50]  John E. Mitchell,et al.  Computational Experience with an Interior Point Cutting Plane Algorithm , 1999, SIAM J. Optim..

[51]  John E. Mitchell,et al.  Polynomial Interior Point Cutting Plane Methods , 2003, Optim. Methods Softw..

[52]  Peter Schlattmann,et al.  Theory and Algorithms , 2009 .

[53]  James Renegar,et al.  Condition Numbers, the Barrier Method, and the Conjugate-Gradient Method , 1996, SIAM J. Optim..

[54]  H. P. Williams.  THEORY OF LINEAR AND INTEGER PROGRAMMING (Wiley-Interscience Series in Discrete Mathematics and Optimization) , 1989 .

[55]  Jean-Philippe Vial,et al.  A cutting plane method from analytic centers for stochastic programming , 1995, Math. Program..

[56]  K. Schittkowski,et al.  NONLINEAR PROGRAMMING , 2022 .

[57]  Jorge R. Vera,et al.  On the complexity of linear programming under finite precision arithmetic , 1998, Math. Program..

[58]  Laurent El Ghaoui,et al.  Robust Solutions to Least-Squares Problems with Uncertain Data , 1997, SIAM J. Matrix Anal. Appl..

[59]  Peter Kall,et al.  Stochastic Programming , 1995 .

[60]  Javier Peña,et al.  Conditioning of Convex Programs from a Primal-Dual Perspective , 2001, Math. Oper. Res..

[61]  John R. Birge,et al.  Introduction to Stochastic Programming , 1997 .

[62]  Donald Goldfarb,et al.  Robust Portfolio Selection Problems , 2003, Math. Oper. Res..

[63]  Yun-Bin Zhao,et al.  Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets , 2008, SIAM J. Optim..

[64]  Robert M. Freund,et al.  A New Condition Measure, Preconditioners, and Relations Between Different Measures of Conditioning for Conic Linear Systems , 2002, SIAM J. Optim..

[65]  Melvyn Sim,et al.  Robust discrete optimization and network flows , 2003, Math. Program..

[66]  Javier Peña,et al.  A characterization of the distance to infeasibility under block-structured perturbations , 2003 .

[67]  James Renegar,et al.  Computing approximate solutions for convex conic systems of constraints , 2000, Math. Program..

[68]  Dimitris Bertsimas,et al.  A Robust Optimization Approach to Supply Chain Management , 2004, IPCO.

[69]  Javier Peña,et al.  Understanding the Geometry of Infeasible Perturbations of a Conic Linear System , 1999, SIAM J. Optim..