Article ID: | iaor20122111 |
Volume: | 219 |
Issue: | 2 |
Start Page Number: | 452 |
End Page Number: | 457 |
Publication Date: | Jun 2012 |
Journal: | European Journal of Operational Research |
Authors: | Conde Eduardo |
Keywords: | approximation, minimax problem, NP-hard, regret theory |
In order to find a robust solution under an unknown linear cost function it will be considered the minmax regret criterion. It is assumed the vector of costs can take on values from a given uncertainty set. The resulting optimization model has been extensively analyzed in the literature when the uncertain costs are modeled by closed intervals. Unfortunately, except for rare applications, this problem has NP‐hard complexity which has led to the appearance of approximated methods seeking for