Strong Formulations of Robust Mixed 0–1 Programming

We introduce strong formulations for robust mixed 0–1 programming with uncertain objective coefficients. We focus on a polytopic uncertainty set described by a ``budget constraint'' for allowed uncertainty in the objective coefficients. We show that for a robust 0–1 problem, there is an α–tight linear programming formulation with size polynomial in the size of an α–tight linear programming formulation for the nominal 0–1 problem. We give extensions to robust mixed 0–1 programming and present computational experiments with the proposed formulations.

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

[2]  Melvyn Sim,et al.  Robust Discrete Optimization , 2003 .

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

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

[5]  A Gerodimos,et al.  Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..

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

[7]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

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

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

[10]  Melvyn Sim,et al.  Robust linear optimization under general norms , 2004, Oper. Res. Lett..

[11]  G. Iyengar,et al.  TR-2004-11 Robust Portfolio Management , 2004 .

[12]  Laurence A. Wolsey,et al.  Tight formulations for some simple mixed integer programs and convex objective integer programs , 2003, Math. Program..

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

[14]  Igor Averbakh,et al.  On the complexity of a class of combinatorial optimization problems with uncertainty , 2001, Math. Program..

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

[16]  Garud Iyengar,et al.  Ambiguous chance constrained problems and robust optimization , 2006, Math. Program..

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

[18]  Hande Yaman,et al.  The robust spanning tree problem with interval data , 2001, Oper. Res. Lett..

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