Skip to main content
Log in

Programming with the Sum of a Linear and Quotient Objective Function

  • Published:
OPSEARCH Aims and scope Submit manuscript

Abstract

Programming problem with linear constraints and the objective function as the sum of the functions of the form f(x) + 1/g(x) where f(x) and g(x) are linear, has been reduced to a fractional programming problem with linear constraints and the objective function as an explicitly quasiconvex.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Aggarwal S. P. “A note on quasiconvex programming.” Metrika, 12 (1967) 97–105.

    Article  Google Scholar 

  2. Charnes A. and Cooper W. W. “Programming with linear fractional functionals.” Naval Research Log. Quart., 9 (1962) 181–186.

    Article  Google Scholar 

  3. Joksch H. C. “Programming with fractional linear objective functinos,” Naval Research Log. Quart., 11 (1964) 197–204.

    Article  Google Scholar 

  4. Martos B. “Nonlinear progamming: Theory and Methods,” North-Holland Publishing Company, Amsterdam (1975)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Tuteja, G.C. Programming with the Sum of a Linear and Quotient Objective Function. OPSEARCH 37, 177–180 (2000). https://doi.org/10.1007/BF03398608

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03398608

Navigation