Strong Formulations of Robust Mixed 0-1 Programming

@article{Atamtrk2006StrongFO,
  title={Strong Formulations of Robust Mixed 0-1 Programming},
  author={Alper Atamt{\"u}rk},
  journal={Math. Program.},
  year={2006},
  volume={108},
  pages={235-250}
}
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… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
38 Citations
20 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 38 extracted citations

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…