Skip to main content

Fractional bivalent programming

  • 265 Accesses

Part of the Lecture Notes in Mathematics book series (LNM,volume 23)

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   29.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   39.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. CHARNES and W.W. COOPER, Programming with Linear Fractional Functionals. Naval Res. Log. Quarterly, 9, No. 3-4, 181–186 (1962).

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. W. DINKELBACH, Die Maximierung eines Quotienten zweier linearen Funktionen unter linearen Nebendedingungen. Z. Wahrscheinlichkeitstheorie, 1, 141–145 (1962).

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. B. MARTOS, Hyperbolic Programming (in Hungarian). Mag. Tud. Akad. Mat. Kut. Intéz. Közlemenyei, 5, series B. No. 4, 383–406 (1960).

    MathSciNet  MATH  Google Scholar 

Download references

Authors

Rights and permissions

Reprints and Permissions

Copyright information

© 1966 Springer-Verlag

About this chapter

Cite this chapter

Ivănescu, P.L., Rudeanu, S. (1966). Fractional bivalent programming. In: Pseudo-Boolean Methods for Bivalent Programming. Lecture Notes in Mathematics, vol 23. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0077208

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-03606-7

  • Online ISBN: 978-3-540-34835-1

  • eBook Packages: Springer Book Archive