Publication at Faculty of Mathematics and Physics |
2021
Abstract
We consider the interval transportation problem, in which the supply and demand vectors and the transportation costs are uncertain and can be perturbed independently within the known lower and upper bounds. The main goal is to compute the worst value, which is optimal for some feasible scenario of the interval transportation problem.
We derive an exact method for solving this NP-hard problem, based on duality and complementary slackness. Then, we show that the method can be competitive with the currently used heuristic algorithms.