DUALITY IN LINEAR PROGRAMMING PROBLEMS WITH INTERVAL VARIABLES

The decision variables of linear programming (LP) problem are considered to take closed intervals in this paper. Primal and dual pair of interval-valued LP problems are formulated. A solution concept is introduced similar to that of multiobjective programming problems. The weak and strong duality theorems are then proved