An inverse optimization problem is defined as follows. Let S denote the set of feasible solutions of an optimization problem P, let c be a specified cost (capacity) vector, and x0 ∈ S. We want to perturb the cost (capacity) vector c to d so that x0 is an optimal solution of P with respect to...

We describe a new dual algorithm for the minimum cost flow problem. It can be regarded as a variation of the best known strongly polynomial minimum cost flow algorithm, due to Orlin. Indeed we obtain the same running time of O(m log m(m+n log n)), where n and m denote the number of vertices and...