The inverse optimal value problem for linear fractional programming

We study the inverse optimal value problem for linear fractional programming, where the goal is to find the coefficients of the fractional objective function such that the resulting optimal objective function value is as close as possible to some given target value. We show that this problem is NP-h...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Operations research letters Jg. 59; S. 107251
Hauptverfasser:	Nadi, Sina, Lee, Taewoo, Prokopyev, Oleg A.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.03.2025
Schlagworte:	Charnes-Cooper transformation Inverse optimal value problem Inverse optimization Linear fractional programming Mixed integer programming Inverse optimal value problem Mixed integer programming Inverse optimization Charnes-Cooper transformation Linear fractional programming
ISSN:	0167-6377
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	We study the inverse optimal value problem for linear fractional programming, where the goal is to find the coefficients of the fractional objective function such that the resulting optimal objective function value is as close as possible to some given target value. We show that this problem is NP-hard. Then, we provide some structural results, which are exploited to derive several reformulations and two solution algorithms. The proposed approaches are based on the Charnes-Cooper and parametric transformations.
ISSN:	0167-6377
DOI:	10.1016/j.orl.2025.107251