Let E be a finite set, ℱ be a family of subsets of E and &Cmacr; be a capacity vector for all elements of E. For each F ∈ ℱ, define the capacity of F as the minimum capacity occurring in F. The problem which we discuss in this paper is how to change the vector &Cmacr; as little as possible so that a given F0 ∈ ℱ has the maximum capacity. This model contains inverse maximum capacity spanning tree problem, inverse maximum capacity path problem, etc. as its special cases. We transform the problem into the minimum weight cut set problem and show that this problem can be solved efficiently if an efficient algorithm for finding minimum weight cut set of ℱ is available.
