Mathematical Programming

, Volume 98, Issue 1–3, pp 49–71 | Cite as

Robust discrete optimization and network flows

Article

Abstract.

We propose an approach to address data uncertainty for discrete optimization and network flow problems that allows controlling the degree of conservatism of the solution, and is computationally tractable both practically and theoretically. In particular, when both the cost coefficients and the data in the constraints of an integer programming problem are subject to uncertainty, we propose a robust integer programming problem of moderately larger size that allows controlling the degree of conservatism of the solution in terms of probabilistic bounds on constraint violation. When only the cost coefficients are subject to uncertainty and the problem is a 0−1 discrete optimization problem on n variables, then we solve the robust counterpart by solving at most n+1 instances of the original problem. Thus, the robust counterpart of a polynomially solvable 0−1 discrete optimization problem remains polynomially solvable. In particular, robust matching, spanning tree, shortest path, matroid intersection, etc. are polynomially solvable. We also show that the robust counterpart of an NP-hard α-approximable 0−1 discrete optimization problem, remains α-approximable. Finally, we propose an algorithm for robust network flows that solves the robust counterpart by solving a polynomial number of nominal minimum cost flow problems in a modified network.

Keywords

integer programming robust optimization network flows 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ahuja, R., Magnanti, T., Orlin, J.: Network flows: theory, algorithms, and applications. Prentice Hall, New York. 1993Google Scholar
  2. 2.
    Averbakh, I.: On the complexity of a class of combinatorial optimization problems with uncertainty. Math. Prog. 90, 263–272 (2001)Google Scholar
  3. 3.
    Ben-Tal, A., Nemirovski, A.: Robust solutions of linear programming problems contaminated with uncertain data. Math. Prog. 88, 411–424 (2000)Google Scholar
  4. 4.
    Ben-Tal, A., Nemirovski, A.: Robust solutions to uncertain programs. Oper. Res. Lett. 25, 1–13 (1999)Google Scholar
  5. 5.
    Ben-Tal, A., Nemirovski, A.: Robust convex optimization. Math. Oper. Res. 23, 769–805 (1998)Google Scholar
  6. 6.
    Ben-Tal, A., El-Ghaoui, L., Nemirovski, A.: Robust semidefinite programming. In: Saigal, R., Vandenberghe, L., Wolkowicz, H., (eds), Semidefinite Programming and Applications, Kluwer Academic Publishers, 2000Google Scholar
  7. 7.
    Bertsimas, D., Sim, M.: The Price of Robustness. Working Paper, Operations Research Center, MIT, 2001Google Scholar
  8. 8.
    Birge, J.R.: The value of the stochastic solutions in stochastic linear programs with fixed recourse. Math. Prog. 24, 314–325 (1982)Google Scholar
  9. 9.
    Dantzig, G.B.: Linear programming under uncertainty. Mgmt. Sci. 197–206 (1955)Google Scholar
  10. 10.
    Dijkstra, E.W.: A note on two problems in connection with graphs. Numer. Math. 269–271 (1959)Google Scholar
  11. 11.
    El-Ghaoui, Lebret, H.: Robust solutions to least-square problems to uncertain data matrices. SIAM J. Matrix Anal. Appl. 18, 1035–1064 (1997)Google Scholar
  12. 12.
    El-Ghaoui, L., Oustry, F., Lebret, H.: Robust solutions to uncertain semidefinite programs. SIAM J. Optim. 9, 33–52 (1998)Google Scholar
  13. 13.
    Kouvelis, P., Yu, G.: Robust discrete optimization and its applications. Kluwer Academic Publishers, Norwell, MA, 1997Google Scholar
  14. 14.
    Mulvey, J.M., Vanderbei, R.J., Zenios, S.A.: Robust optimization of large-scale systems. Oper. Res. 43, 264–281 (1995)Google Scholar
  15. 15.
    Nemhauser, G., Wolsey, L.: Integer and combinatorial optimization. John Wiley and Sons, New York. 1988Google Scholar
  16. 16.
    Schultz, R., Stougie, L., van der Vlerk, M.: Solving stochastic programs with complete integer recourse by enumeration: a framework using Grobner basis reductions. Math. Prog. 83, 229–252 (1998)Google Scholar
  17. 17.
    Soyster, A.L.: Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper. Res. 21, 1154–1157 (1973)Google Scholar
  18. 18.
    Srinivasan, V., Thompson, G.L.: An operator theory of parametric programming for the transportation problem. Naval Research Logistics Quarterly 19, 205–252 (1972)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  1. 1.Boeing Professor of Operations ResearchSloan School of Management and Operations Research Center, Massachusetts Institute of TechnologyCambridge
  2. 2.Operations Research CenterMassachusetts Institute of TechnologyCambridge

Personalised recommendations