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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of global optimization Ročník 55; číslo 3; s. 491 - 506
Hlavní autor:	Wang, Lizhi
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Boston Springer US 01.03.2013 Springer Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!