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

Full description

Saved in:

Bibliographic Details
Published in:	Journal of global optimization Vol. 55; no. 3; pp. 491 - 506
Main Author:	Wang, Lizhi
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.03.2013 Springer Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!