Inverse minimum flow problem under the weighted sum-type Hamming distance

摘要

The idea of the inverse optimization problem is to adjust the value of the parameters such that the observed feasible solution becomes optimal. The modification cost can be measured by different norms, such as l(1), l(2), l(infinity) norms and the Hamming distance, and the goal is to adjust the parameters as little as possible.