Given a network N(V, A, u, c) and a feasible flow x0, an inverse minimum cost flow problem is to modify the cost vector as little as possible to make x0 form a minimum cost flow of the network. The modification can be measured by different norms. In this paper, we consider the inverse minimum...

Given an undirected network G(V, E, c) and a perfect matching M <Superscript>0</Superscript>, the inverse maximum perfect matching problem is to modify the cost vector as little as possible such that the given perfect matching M <Superscript>0</Superscript> can form a maximum perfect matching. The modification can be measured by different norms. In...</superscript></superscript>

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...