Various approaches to multiobjective linear programming problems with interval costs and interval weights
Abstrakt
Optimization problems are often subject to various kinds of inexactness or inaccuracy of input data. Here, we consider multiobjective linear programming problems, in which two kinds of input entries have the form of interval data.
First, we suppose that the objectives entries are interval values, and, second, we suppose that we have an interval estimation of weights of the particular criteria. These two types of interval data naturally lead to various definitions of efficient solutions.
We discuss six meaningful concepts of efficient solutions and compare them to each other. For each of them, we attempt to characterize the corresponding kind efficiency and investigate computational complexity of deciding whether a given solution is efficient.