Strong formulations of robust mixed 0-1 programming

Mathematical Programming

Volumn 108, Issue 2-3, 2006, Pages 235-250

  Atamtürk, Alper ^a  

^a DEPARTMENT OF INDUSTRIAL ENGINEERING AND OPERATIONS RESEARCH   (United States)

Author keywords

Computation; Modeling; Polyhedra; Robust optimization

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SIMULATION; POLYNOMIALS; PROBLEM SOLVING; UNCERTAIN SYSTEMS;

POLYHEDRA; POLYTOPIC UNCERTAINTY; ROBUST OPTIMIZATION;

LINEAR PROGRAMMING;

EID: 33745726320     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-006-0709-5     Document Type: Article

References (20)

1. Atamtürk, A., Zhang, M.: Two-stage robust network flow and design under demand uncertainty. Research Report BCOL.04.03, University of California-Berkeley, Dec 2004. Available at http://ieor.berkeley.edu/~atamturk
2. Averbakh, I.: On the complexity of a class for combinatorial optimization problems with uncertainty. Mathematical Programming 90, 263-272 (2001)
3. Balas, E.: Disjunctive programming. Annals of Discrete Mathematics 5, 3-51 (1979)
4. Ben-Tal, A., Goryashko.A., Guslitzer, E., Nemirovski, A.: Adjustable robust solutions of uncertain linear programs. Mathematical Programming 99, 351-376 (2004)
5. Ben-Tal, A., Nemirovski, A.: Robust convex optimization. Mathematics of Operations Research 23, 769-805 (1998)
6. Ben-Tal, A., Nemirovski, A., Roos, C.: Robust solutions to uncertain quadratic and conic-quadratic problems. SIAM Journal on Optimization 13, 535-560 (2002)
7. Bertsimas, D., Pachamanova, D., Sim, M.: Robust linear optimization under general norms. Operations Research Letters 32, 510-526 (2004)
8. Bertsimas, D., Sim, M.: Robust discrete optimization and network flows. Mathematical Programming 98, 49-71 (2003)
9. Bertsimas D., Sim, M.: Robust conic optimization. Manuscript, 2004
10. Bertsimas, D., Sim, M.: Robust discrete optimization under ellipsoid uncertainty sets. Manuscript, 2004
11. Bertsimas, D., Thiele, A.: A robust optimization approach to supply chain management. In Proceedings of IPCO X Conference, volume 3064 of Lecture Notes in Computer Science, pages 86-100, 2004
12. Erdogan, E., Goldfarb, D., Iyengar, G.: Robust portfolio management. CORC Technical Report TR-2004-11, Columbia University, 2004
13. Erdogan, E., Iyengar, G.: Ambiguous chance constrained problems and robust optimization. CORC Technical Report TR-2004-10, Columbia University, 2004
14. Ghaoui, L.El., Lebret, H.: Robust solutions to least-squares problems with uncertain data. 18, 1035-1064 (1997)
15. Ghaoui, L.El., Oustry, F., Lebret, H.: Robust solutions to uncertain semideflnite programs. SIAM Journal on Optimization 9, 33-52 (1998)
16. Goldfarb, D., Iyengar, G.: Robust portfolio selection problems. Mathematics of Operations Research 28, 1-38 (2003)
17. Grötschel, M., Lovász, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 169-197 (1981)
18. Pinar, M.C., Yaman, H., Karasan, O.E.: The robust minimum spanning tree problem with interval data. Operations Research Letters 29, 31-40 (2001)
19. Kouvelis, P., Yu, G.: Robust discrete optimization and its applications. Kluwer Academic Publishers, Norwell, MA, 1997
20. Miller A., Wolsey, L.A.: Tight formulations for some simple mixed integer programs and convex objective integer programs. Mathematical Programming 98, 73-88 (2003)