Abstrakt
Bilevel linear programming provides a suitable mathematical model for many practical optimization problems. Since the real-world data are often inaccurate or uncertain, we consider the model under interval uncertainty, in which only the lower and upper bounds on the input data are available and we assume that the uncertain coefficients can be perturbed independently within the given intervals.
Building on the theory of interval optimization and bilevel linear programming, we study the basic properties of bilevel interval linear programs from both a theoretical and a computational point of view. In our study, we focus on the main problems solved in interval optimization, such as computing the range of optimal values, checking the existence of feasible and optimal solutions and testing unboundedness of a scenario in the interval program.