On relation of possibly efficiency and robust counterparts in interval multiobjective linear programming
2017
Abstrakt
We investigate multiobjective linear programming with uncertain cost coefficients. We assume that lower and upper bounds for uncertain values are known, no other assumption on uncertain costs is needed.
We focus on the so called possibly efficiency, which is defined as efficiency of at least one realization of interval coefficients. We show many favourable properties including existence, low computational performance of determining possibly efficient solutions, convexity of the dominance cone or connectedness or the efficiency set.
In the second part, we discuss robust optimization approach for dealing with uncertain costs. We show that the corresponding robust counterpart is closely related to possible efficiency.