Cutting plane algorithms for the inverse mixed integer linear programming problem

Authors:
Lizhi Wang
Affiliations:
Industrial and Manufacturing Systems Engineering, Iowa State University, Ames, IA 50011, USA
Venue:
Operations Research Letters
Year:
2009

Citing 4
Cited 4

On an instance of the inverse shortest paths problem

Mathematical Programming: Series A and B
Inverse Optimization

Operations Research
Inverse problems of some NP-complete problems

AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
MIPLIB 2003

Operations Research Letters

Inverse scheduling: two-machine flow-shop problem

Journal of Scheduling
Heuristic algorithms for the inverse mixed integer linear programming problem

Journal of Global Optimization
Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem

Journal of Global Optimization
Note: Inverse multi-objective combinatorial optimization

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.