Calculating some inverse linear programming problems

In this paper we consider some inverse LP problems in which we need to adjust the cost coefficients of a given LP problem as little as possible so that a known feasible solution becomes the optimal one. A method for solving general inverse LP problem including upper and lower bound constraints is suggested which is based on the optimality conditions for LP problems. It is found that when the method is applied to inverse minimum cost flow problem or inverse assignment problem, we are able to obtain strongly polynomial algorithms.