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.

Uložené v:

Podrobná bibliografia
Vydané v:	Operations research letters Ročník 37; číslo 2; s. 114 - 116
Hlavný autor:	Wang, Lizhi
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Oxford Elsevier B.V 01.03.2009 Elsevier
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	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