The linear-fractional programming problem is one in which the objective to be maximized is of the form f (xv) = (cxv + α)/(dxv + β) subject to Axv ≤ bv, xv ≥ 0, where α and β are scalars, cv and dv are row vectors of given numbers, and bv is the right-hand-side vector. The problem can be converted to an equivalent linear programming problem by the translation yv = xv/(dxv + β), provded that dxv + β does not change sign in the feasible region. Fractional programming.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Kluwer Academic Publishers
About this entry
Cite this entry
Gass, S.I., Harris, C.M. (2001). Linear-fractional programming problem . In: Gass, S.I., Harris, C.M. (eds) Encyclopedia of Operations Research and Management Science. Springer, New York, NY. https://doi.org/10.1007/1-4020-0611-X_542
Download citation
DOI: https://doi.org/10.1007/1-4020-0611-X_542
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-7923-7827-3
Online ISBN: 978-1-4020-0611-1
eBook Packages: Springer Book Archive