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.

Saved in:

Bibliographic Details
Published in:	Operations research letters Vol. 37; no. 2; pp. 114 - 116
Main Author:	Wang, Lizhi
Format:	Journal Article
Language:	English
Published:	Oxford Elsevier B.V 01.03.2009 Elsevier
Subjects:	Applied sciences Exact sciences and technology Inverse optimization Mathematical programming Mixed integer linear programming Operational research and scientific management Operational research. Management science Inverse optimization Mixed integer linear programming Integer programming Linear programming Mixed integer programming Objective function Cutting plane method Optimization Inverse problem
ISSN:	0167-6377, 1872-7468
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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.
ISSN:	0167-6377 1872-7468
DOI:	10.1016/j.orl.2008.12.001