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...
Saved in:
| Published in: | Operations research letters Vol. 59; p. 107251 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier B.V
01.03.2025
|
| Subjects: | |
| ISSN: | 0167-6377 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!