Inverse matroid optimization problem under Chebyshev distance

Given a matroid (S, I) and a utility vector c associated with elements of S, the inverse matroid optimization problem is to modify the vector c as little as possible such that a given set I-0 is an element of I becomes a maximum independent set with respect to the modified utility vector. The modifications can be measured by different distances. In this paper, we consider the inverse matroid optimization problem under the Chebyshev distance. It is shown that the problem can be solved in polynomial time.