首页 | 本学科首页   官方微博 | 高级检索  
     


Min-Max Regret Robust Optimization Approach on Interval Data Uncertainty
Authors:T. Assavapokee  M. J. Realff  J. C. Ammons
Affiliation:(1) Department of Industrial Engineering, University of Houston, Houston, TX, USA;(2) Department of Chemical and Biomolecular Engineering, Georgia Institute of Technology, Atlanta, GA, USA;(3) Department of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA
Abstract: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. This work was supported by the National Science Foundation through Grant DMI-0200162.
Keywords:Robust optimization  Interval data uncertainty  Min-max regret robust optimization  Deviation robust optimization
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号