Abstrakt
This paper deals with the problem of linear programming with inexact data represented by real intervals. We introduce the concept of duality gap to interval linear programming.
We give characterizations of strongly and weakly zero duality gap in interval linear programming and its special case where the matrix of coefficients is real. We show computational complexity of testing weakly- and strongly zero duality gap for commonly used types of interval linear programming.