On handling indicator constraints in mixed integer programming

Mixed integer programming (MIP) is commonly used to model indicator constraints, i.e., constraints that either hold or are relaxed depending on the value of a binary variable. Unfortunately, those models tend to lead to weak continuous relaxations and turn out to be unsolvable in practice; this is w...

Full description

Saved in:

Bibliographic Details
Published in:	Computational optimization and applications Vol. 65; no. 3; pp. 545 - 566
Main Authors:	Belotti, Pietro, Bonami, Pierre, Fischetti, Matteo, Lodi, Andrea, Monaci, Michele, Nogales-Gómez, Amaya, Salvagnin, Domenico
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.12.2016 Springer Nature B.V Springer Verlag
Subjects:	Algorithms Classification Computation Computer Science Constraint modelling Convex and Discrete Geometry Indicators Integer programming Linear programming Management Science Mathematical analysis Mathematical models Mathematics Mathematics and Statistics Operations Research Operations Research/Decision Theory Optimization Quadratic programming Statistics Studies Support vector machines Tightening Indicator constraints Mixed-integer quadratic programming Mixed-integer linear programming
ISSN:	0926-6003, 1573-2894
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!