An interval linear-programming problem (IP) is Maximize c T x s.t. b - ⩽ Ax ⩽ b +, where the matrix A, vectors b -, b + and c are given. In this paper we develop a primal algorithm for solving IP. The algorithm starts with a feasible solution (not necessarily an extreme point) and produces, after finitely many iterations, an optimal solution to an IP.
Read full abstract