Publikace na Matematicko-fyzikální fakulta |
2017
Abstrakt
We consider a linear programming problem with interval data. We discuss the problem of checking whether a given solution is optimal for each realization of interval data.
This problem was studied for particular forms of linear programming problems. Herein, we extend the results to a general model and simplify the overall approach.
Moreover, we inspect computational complexity, too. Eventually, we investigate a related optimality concept of semi-strong optimality, showing its characterization and complexity.