Cutting plane algorithms for the inverse mixed integer linear programming problem

Cutting plane algorithms for the inverse mixed integer linear programming problem

0.00 Avg rating0 Votes
Article ID: iaor20102935
Volume: 37
Issue: 2
Start Page Number: 114
End Page Number: 116
Publication Date: Mar 2009
Journal: Operations Research Letters
Authors:
Keywords: cutting plane algorithms
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.

Reviews

Required fields are marked *. Your email address will not be published.