EconPapers    
Economics at your fingertips  
 

Min max min robust (relative) regret combinatorial optimization

Alejandro Crema ()
Additional contact information
Alejandro Crema: Universidad Central de Venezuela

Mathematical Methods of Operations Research, 2020, vol. 92, issue 2, No 2, 249-283

Abstract: Abstract We consider combinatorial optimization problems with uncertainty in the cost vector. Recently, a novel approach was developed to deal with such uncertainties: instead of a single one robust solution, obtained by solving a min max problem, the authors consider a set of solutions obtained by solving a min max min problem. In this new approach, the set of solutions is computed once and we can choose the best one in real time each time a cost vector occurs yielding better solutions compared to the min max approach. In this paper, we apply the new approach to the absolute and relative regret cases. Algorithms to solve the min max min robust (relative) regret problems are presented with computational experiments.

Keywords: Minmax regret; Robust programming; Greedy algorithms; Multiparametric programming (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s00186-020-00712-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:92:y:2020:i:2:d:10.1007_s00186-020-00712-y

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s00186-020-00712-y

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-03-20
Handle: RePEc:spr:mathme:v:92:y:2020:i:2:d:10.1007_s00186-020-00712-y