Publication at Faculty of Mathematics and Physics |
2023
Abstract
We consider the model of an interval transportation problem, in which the values of supply, demand and the transportation costs are affected by uncertainty and can be independently perturbed within the given bounds. We address the problem of computing the worst (finite) optimal value of the interval model over all possible scenarios.
Utilizing a related result from bilevel programming, we prove that computing the value exactly is NP-hard for two commonly used formulations of the interval transportation problem.