Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem

This paper presents branch-and-bound algorithms for the partial inverse mixed integer linear programming (PInvMILP) problem, which is to find a minimal perturbation to the objective function of a mixed integer linear program (MILP), measured by some norm, such that there exists an optimal solution t...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of global optimization Jg. 55; H. 3; S. 491 - 506
1. Verfasser:	Wang, Lizhi
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Boston Springer US 01.03.2013 Springer Springer Nature B.V
Schlagworte:	Algorithms Alternative energy Branch & bound algorithms Computation Computer Science Decision making Inverse Inverse problems Linear programming Mathematical models Mathematics Mathematics and Statistics Mixed integer Norms Operations Research/Decision Theory Optimization Real Functions Renewable resources Studies Variables Branch-and-bound Inverse optimization Linear program with complementarity constraints Partial inverse mixed integer linear programming
ISSN:	0925-5001, 1573-2916, 1573-2916
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!