Minimising the maximum relative regret for linear programmes with interval objective function coefficients |
| |
Authors: | H E Mausser M Laguna |
| |
Institution: | 1.Algorithmics Incorporated,Ontario,Canada;2.University of Colorado,Colorado,USA |
| |
Abstract: | The minimax relative regret solution to a linear programme with interval objective function coefficients can be found using an algorithm that, at each iteration, solves a linear programme to generate a candidate solution and a mixed integer programme (MIP) to find the corresponding maximum regret. This paper first shows that there exists a regret-maximising solution in which all uncertain costs are at a bound, and then uses this to derive a MIP formulation that maximises the regret of a candidate solution. Computational experiments demonstrate that this approach is effective for problems with up to 50 uncertain objective function coefficients, significantly improving upon the existing enumerative method. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|