Interval method for interval linear program
Radimir Viher · University of Zagreb University Computing Centre (SRCE) · 2003
In the problem of interval linear programming (i) max c T x a ≤ Ax ≤ b (i) m−1 . It is known when c ∈R (A T ) that problem (i) has an explicit solution. In this article we formulate the analogous theorem for the second form (ii), and then show the ap- plication of those results on the problem of sensitivity analyses.