Publication at Faculty of Mathematics and Physics |
2016
Abstract
We consider a linear programming problem in a general form and suppose that all coefficients may vary in some prescribed intervals. Contrary to classical models, where parameters can attain any value from the interval domains independently, we study problems with linear dependencies between the parameters.
We present a class of problems that are easily solved by reduction to the classical case. In contrast, we also show a class of problems with very simple dependencies, which appear to be hard to deal with.
We also point out some interesting open problems.