A simple technique to improve linearized reformulations of fractional (hyperbolic) 0–1 programming problems

We consider reformulations of fractional (hyperbolic) 0–1 programming problems as equivalent mixed-integer linear programs (MILP). The key idea of the proposed technique is to exploit binary representations of certain linear combinations of the 0–1 decision variables. Consequently, under some mild c...

Full description

Saved in:

Bibliographic Details
Published in:	Operations research letters Vol. 44; no. 4; pp. 479 - 486
Main Authors:	Borrero, Juan S., Gillen, Colin, Prokopyev, Oleg A.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.07.2016
Subjects:	Binary representations Equivalence Fractional 0–1 programming Hyperbolic 0–1 programming Linear programming Linearization Mathematical models Mixed integer linear programs Operations research Programming Representations Binary representations Hyperbolic 0–1 programming Fractional 0–1 programming Mixed integer linear programs Linearization
ISSN:	0167-6377, 1872-7468
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!