论文信息 - Cutting plane algorithms for the inverse mixed integer linear programming problem - 字舞流文

Cutting plane algorithms for the inverse mixed integer linear programming problem

We present cutting plane algorithms for the inverse mixed integer linear programming problem (InvMILP), which is to minimally perturb the objective function of a mixed integer linear program in order to make a given feasible solution optimal.

Lizhi Wang | Lizhi Wang

[1] Jianzhon Zhang,et al. Two general methods for inverse optimization problems , 1999 .

[2] Thorsten Koch,et al. Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin Miplib 2003 , 2022 .

[3] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .

[4] Clemens Heuberger,et al. Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results , 2004, J. Comb. Optim..

[5] Garud Iyengar,et al. Inverse conic programming with applications , 2005, Oper. Res. Lett..

[6] Siming Huang,et al. Inverse Problems of Some NP-Complete Problems , 2005, AAIM.

[7] Philippe L. Toint,et al. On an instance of the inverse shortest paths problem , 1992, Math. Program..

[8] Ravindra K. Ahuja,et al. Inverse Optimization , 2001, Oper. Res..