4.5 Article

Min-max regret robust optimization approach on interval data uncertainty

Journal

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS
Volume 137, Issue 2, Pages 297-316

Publisher

SPRINGER/PLENUM PUBLISHERS
DOI: 10.1007/s10957-007-9334-6

Keywords

robust optimization; interval data uncertainty; min-max regret robust optimization; deviation robust optimization

Ask authors/readers for more resources

This paper presents a three-stage optimization algorithm for solving two-stage deviation robust decision making problems under uncertainty. The structure of the first-stage problem is a mixed integer linear program and the structure of the second-stage problem is a linear program. Each uncertain model parameter can independently take its value from a real compact interval with unknown probability distribution. The algorithm coordinates three mathematical programming formulations to iteratively solve the overall problem. This paper provides the application of the algorithm on the robust facility location problem and a counterexample illustrating the insufficiency of the solution obtained by considering only a finite number of scenarios generated by the endpoints of all intervals.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available