Skip to main content

Linear-fractional programming problem

  • Reference work entry
  • First Online:
Encyclopedia of Operations Research and Management Science
  • 34 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 532.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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

Publish with us

Policies and ethics