Restricted Robust Uniform Matroid Maximization Under Interval Uncertainty

Authors:
H. Yaman;O. E. Karaşan;M. Ç. Pınar
Affiliations:
Bilkent University, Department of Industrial Engineering, Ankara, Turkey;Bilkent University, Department of Industrial Engineering, Ankara, Turkey;Bilkent University, Department of Industrial Engineering, Ankara, Turkey
Venue:
Mathematical Programming: Series A and B
Year:
2007

Citing 0
Cited 2

The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations

INFORMS Journal on Computing
Minmax regret bottleneck problems with solution-induced interval uncertainty structure

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

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.