Skip to main content
SpringerLink
Log in

Quadratic Fractional Programming: Dinkelbach Method

  • Reference work entry
Encyclopedia of Optimization

  • 1632 Accesses

Article Outline

Keywords

Problem Formulation and Properties

Bounds and Convergence Rates

Special Cases

See also

References

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

References

  1. Avriel M, Diewart WE, Shaible S, Zang I (1988) Generalized concavity. Plenum, New York

    MATH  Google Scholar 

  2. Dinkelbach W (1967) On nonlinear fractional programming. Managem Sci 13(7):492–498

    MathSciNet  Google Scholar 

  3. Grunspan M (1971) Fractional programming: A survey. Techn Report FL 50, Dept Industr Systems Engin, Univ Florida, Gainesville

    Google Scholar 

  4. Ibaraki T (1983) Parametric approaches to fractional programs. Math Program 26:345–362

    Article  MATH  MathSciNet  Google Scholar 

  5. Isbell JR, Marlow WH (1956) Attrition games. Naval Res Logist Quart 3:71–93

    Article  MathSciNet  Google Scholar 

  6. Pardalos PM (1986) An algorithm for a class of nonlinear fractional problems using ranking of the vertices. BIT 26:392–395

    Article  MATH  MathSciNet  Google Scholar 

  7. Pardalos PM, Phillips AT (1991) Global optimization of fractional programs. J Global Optim 1:173–182

    Article  MATH  MathSciNet  Google Scholar 

  8. Phillips AT, Rosen JB (1990) Guaranteed ϵ-approximate solution for indefinite quadratic global minimization. Naval Res Logist 37:499–514

    Article  MATH  MathSciNet  Google Scholar 

  9. Phillips AT, Rosen JB (1990) A parallel algorithm for partially separable non-convex global minimization. Ann Oper Res 25:101–118

    Article  MATH  MathSciNet  Google Scholar 

  10. Schaible S (1976) Fractional programming I, duality. Managem Sci 22(8):858–867

    MATH  MathSciNet  Google Scholar 

  11. Schaible S (1976) Fractional programming II, on Dinkelbach's algorithm. Managem Sci 22(8):868–873

    MATH  MathSciNet  Google Scholar 

  12. Schaible S (1981) Fractional programming: Applications and algorithms. Europ J Oper Res 12:325–338

    Article  MathSciNet  Google Scholar 

  13. Stancu-Minasian IM (1997) Fractional programming. Kluwer, Dordrecht

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Sci. Department, University Wisconsin–Eau Claire, Eau Claire, USA

    Andrew T. Phillips

Authors
  1. Andrew T. Phillips
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Phillips, A.T. (2008). Quadratic Fractional Programming: Dinkelbach Method . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_535

Download citation

Publish with us

Policies and ethics

Search

Navigation