Fractional 0–1 programs: links between mixed-integer linear and conic quadratic formulations

This paper focuses on methods that improve the performance of solution approaches for multiple-ratio fractional 0–1 programs (FPs) in their general structure. In particular, we explore the links between equivalent mixed-integer linear programming and conic quadratic programming reformulations of FPs...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of global optimization Jg. 75; H. 2; S. 273 - 339
Hauptverfasser: Mehmanchi, Erfan, Gómez, Andrés, Prokopyev, Oleg A.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Springer US 01.10.2019
Springer
Springer Nature B.V
Schlagworte:
ISSN:0925-5001, 1573-2916
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper focuses on methods that improve the performance of solution approaches for multiple-ratio fractional 0–1 programs (FPs) in their general structure. In particular, we explore the links between equivalent mixed-integer linear programming and conic quadratic programming reformulations of FPs. Thereby, we show that integrating the ideas behind these two types of reformulations of FPs allows us to push further the limits of the current state-of-the-art results and tackle larger-size problems. We perform extensive computational experiments to compare the proposed approaches against the current reformulations from the literature.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0925-5001
1573-2916
DOI:10.1007/s10898-019-00817-7