Abstract
Multiobjective linear programming problems are considered, where coefficients of objective functions are given by intervals. For this problem, two kinds of efficient solutions are known, namely, necessarily efficient and possibly efficient one. This paper proposes discrimination methods for those efficiencies.