Abstract
For the problem of selecting p items with interval objective function coefficients so as to maximize total profit, we introduce the r-restricted robust deviation criterion and seek solutions that minimize the r-restricted robust deviation. This new criterion increases the modeling power of the robust deviation (minmax regret) criterion by reducing the level of conservatism of the robust solution. It is shown that r-restricted robust deviation solutions can be computed efficiently. Results of experiments and comparisons with absolute robustness, robust deviation and restricted absolute robustness criteria are reported.
Similar content being viewed by others
References
Aron I.D., Van Hentenryck P. (2004) On the complexity of the robust spanning tree problem with interval data. Oper. Res. Lett. 32: 36–40
Averbakh I. (2001) On the complexity of a class of combinatorial optimization problems with uncertainty. Math. Prog. 90: 263–272
Ben-Tal A., Nemirovski A. (1998) Robust convex optimization. Math. OR. 23: 769–805
Ben-Tal A., Nemirovski A. (2000) Lectures on modern convex optimization: analysis, algorithms and engineering applications. SIAM-MPS, Philadelphia
Bertsimas D., Sim M. (2003) Robust discrete optimization and network flows. Math. Prog. B 98: 49–71
Bertsimas D., Sim M. (2004) The price of robustness. Oper. Res. 52: 35–53
Conde E. (2004) An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterion. Math. Prog. 100: 345–353
El-Ghaoui L., Lebret H. (1997) Robust solutions to least squares problems under uncertain data matrices. SIAM J. Matrix Anal. Appl. 18: 1035–1064
Kouvelis P., Yu G. (1997) Robust discrete optimization and applications. Kluwer, Boston
Mausser H.E., Laguna M. (1998) A new mixed integer formulation for the maximum regret problem. Int. Trans. Oper. Res. 5(5): 389–403
Montemanni R., Gambardella L.M. (2005) A branch and bound algorithm for the robust spanning tree problem with interval data. Eur. J. Oper. Res. 161: 771–729
Montemanni R., Gambardella L.M., Donati A.V. (2004) A branch and bound for the robust shortest path problem with interval data. Oper. Res. Lett. 32: 225–232
Schrijver A. (1987) Theory of linear and integer programming. Wiley, New York
Yaman H., Karaşan O.E., Pınar M.Ç. (2001) The robust spanning tree problem with interval data. Oper. Res. Lett. 29: 31–40
Yaman, H., Karaşan, O.E., Pınar, M.Ç. Restricted robust optimization for maximization over uniform matroid with interval data uncertainty. Technical report, Bilkent University, Ankara, Turkey, www.ie.bilkent.edu.tr/~mustafap/pubs/psecrev.pdf (2005)
Zielinski P. (2004) The computational complexity of the relative robust short path problem with interval data. Eur. J. Oper. Res. 158: 570–576
Author information
Authors and Affiliations
Corresponding author
Additional information
This work is supported by a grant from Turkish Academy of Science(TUBA).
Rights and permissions
About this article
Cite this article
Yaman, H., Karaşan, O.E. & Pınar, M.Ç. Restricted Robust Uniform Matroid Maximization Under Interval Uncertainty. Math. Program. 110, 431–441 (2007). https://doi.org/10.1007/s10107-006-0008-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-006-0008-1