Abstrakt
Parametric linear systems with interval coefficients arise in many practical applications in engineering and other related areas. In this paper, we derive a connection between parametric systems and interval linear programming, where interval parametric linear systems can be used to describe the weak optimal solution set.
Then, we discuss the branch-and-prune framework for generating an approximation of the weak feasible set of such systems via a union of interval boxes. We propose two new pruning conditions that can be used to test infeasibility of interval boxes within the framework, based on interval linear algebra and on the geometry of zonotopes.
Furthermore, we also design a condition for pruning the interval boxes by feasibility, which allows us to generate an inner approximation of the weak feasible set. Computational experiments illustrate competitiveness of the proposed pruning tests in comparison with other available pruning conditions.
The experiments indicate that the test based on interval linear algebra usually produces the least number of boxes, while the zonotope-based test is right behind and runs several times faster.