Access the full text.
Sign up today, get DeepDyve free for 14 days.
G. Dantzig (2004)
Linear Programming Under UncertaintyManag. Sci., 50
A. Gerodimos (1996)
Robust Discrete Optimization and its ApplicationsJournal of the Operational Research Society, 49
L. Ghaoui, H. Lebret (1997)
ROBUST SOLUTIONS TO LEAST-SQUARE PROBLEMS TO UNCERTAIN DATA MATRICES, 18
D. Bertsimas, Melvyn Sim (2004)
The Price of RobustnessOper. Res., 52
J. Birge (1982)
The value of the stochastic solution in stochastic linear programs with fixed recourseMathematical Programming, 24
R. Schultz, L. Stougie, M. Vlerk (1998)
Solving stochastic programs with integer recourse by enumeration: a framework using Gro¨bner basis reductionsMathematical Programming, 83
A. Soyster (1973)
Technical Note - Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear ProgrammingOper. Res., 21
J. Mulvey, R. Vanderbei, S. Zenios (1995)
Robust Optimization of Large-Scale SystemsOper. Res., 43
A. Tal, A. Nemirovski (1999)
ROBUST SOLUTIONS TO UNCERTAIN PROGRAMS, 25
E. Dijkstra (1959)
A note on two problems in connexion with graphsNumerische Mathematik, 1
A. Ben-Tal, A. Nemirovski (2000)
Robust solutions of Linear Programming problems contaminated with uncertain dataMathematical Programming, 88
L. Ghaoui, F. Oustry, H. Lebret (1998)
Robust Solutions to Uncertain Semidefinite ProgramsSIAM J. Optim., 9
I. Averbakh (2001)
On the complexity of a class of combinatorial optimization problems with uncertaintyMathematical Programming, 90
A. Ben-Tal, A. Nemirovski (1998)
Robust Convex OptimizationMath. Oper. Res., 23
R. Ahuja, T. Magnanti, J. Orlin (1993)
Network Flows: Theory, Algorithms, and Applications
L. Ghaoui, H. Lebret (1997)
Robust Solutions to Least-Squares Problems with Uncertain DataSIAM J. Matrix Anal. Appl., 18
V. Srinivasan, G. Thompson (1972)
An operator theory of parametric programming for the transportation problem‐IINaval Research Logistics Quarterly, 19
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.
Mathematical Programming – Springer Journals
Published: May 7, 2003
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.