Min-max regret robust optimization approach on interval data uncertainty

被引:39
作者
Assavapokee, T. [1 ]
Realff, M. J. [2 ]
Ammons, J. C. [3 ]
机构
[1] Univ Houston, Dept Ind Engn, Houston, TX 77204 USA
[2] Georgia Inst Technol, Dept Chem & Biomol Engn, Atlanta, GA 30332 USA
[3] Georgia Inst Technol, Dept Ind & Syst Engn, Atlanta, GA 30332 USA
基金
美国国家科学基金会;
关键词
robust optimization; interval data uncertainty; min-max regret robust optimization; deviation robust optimization;
D O I
10.1007/s10957-007-9334-6
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
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.
引用
收藏
页码:297 / 316
页数:20
相关论文
共 20 条
[1]  
[Anonymous], 2003, SUPPLY CHAIN MANAGEM
[2]  
ASSAVAPOKEE T, 2004, THESIS GEORGIA I TEC
[3]   Scenario relaxation algorithm for finite scenario-based min-max regret and min-max relative regret robust optimization [J].
Assavapokee, Tiravat ;
Realff, Matthew J. ;
Ammons, Jane C. ;
Hong, I-Hsuan .
COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (06) :2093-2102
[4]   Minmax regret solutions for minimax optimization problems with uncertainty [J].
Averbakh, I .
OPERATIONS RESEARCH LETTERS, 2000, 27 (02) :57-65
[5]   On the complexity of a class of combinatorial optimization problems with uncertainty [J].
Averbakh, I .
MATHEMATICAL PROGRAMMING, 2001, 90 (02) :263-272
[6]   AN EXPLICIT SOLUTION TO THE MULTILEVEL PROGRAMMING PROBLEM [J].
BARD, JF ;
FALK, JE .
COMPUTERS & OPERATIONS RESEARCH, 1982, 9 (01) :77-100
[7]   SOME PROPERTIES OF THE BILEVEL PROGRAMMING PROBLEM [J].
BARD, JF .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1991, 68 (02) :371-378
[8]   A BRANCH AND BOUND ALGORITHM FOR THE BILEVEL PROGRAMMING PROBLEM [J].
BARD, JF ;
MOORE, JT .
SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING, 1990, 11 (02) :281-292
[9]  
Bard JF, 1998, Practical Bilevel Optimization: Algorithms and Applications
[10]   Robust convex optimization [J].
Ben-Tal, A ;
Nemirovski, A .
MATHEMATICS OF OPERATIONS RESEARCH, 1998, 23 (04) :769-805