Abstrakt
Interval programming provides a mathematical model for uncertain optimization problems, in which the input data can be perturbed independently within the given lower and upper bounds. This paper discusses the recently proposed outcome range problem in the context of interval linear programming.
The motivation for the outcome range problem is to assess further impacts and consequences of optimal decision making, modeled in the program by an additional linear outcome function. Specifically, the goal is to compute a lower and an upper bound on the value of the given outcome function over the optimal solution set of the interval program.
In this paper, we focus mainly on programs with interval coefficients in the objective function and the right-hand-side vector. For this special class of interval programs, we design an algorithm for computing the outcome range exactly, based on complementary slackness and guided basis enumeration.
Finally, we perform a series of computational experiments to evaluate the performance of the proposed method.