Skip to main content
SpringerLink
Log in

Cutting Plane Methods for Global Optimization

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Keywords

Outer Approximation

Inner Approximation

Concavity Cut

Nonlinear Cuts

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. Chen P, Hansen P, Jaumard B (1991) On-line and off-line vertex enumeration by adjacent lists. Oper Res Lett 10:403–409

    Article  MATH  MathSciNet  Google Scholar 

  2. Cheney EW, Goldstein AA (1959) Newton's method for convex programming and Tchebycheff approximation. Numerische Math 1:253–268

    Article  MATH  MathSciNet  Google Scholar 

  3. Horst R, Tuy H (1996) Global optimization: deterministic approaches, 3rd edn. Springer, Berlin

    MATH  Google Scholar 

  4. Kelley JE (1960) The cutting plane method for solving convex programs. J SIAM 8:703–712

    MathSciNet  Google Scholar 

  5. Konno H (1976) A cutting plane algorithm for solving bilinear programs. Math Program 11:14–27

    Article  MATH  MathSciNet  Google Scholar 

  6. Konno H, Thach PT, Tuy H (1997) Optimization on low rank nonconvex structures. Kluwer, Dordrecht

    MATH  Google Scholar 

  7. Tuy H (1964) Concave programming under linear constraints. Soviet Math 5:1437–1440

    Google Scholar 

  8. Tuy H (1998) Convex analysis and global optimization. Kluwer, Dordrecht

    MATH  Google Scholar 

  9. Tuy H (1999) Normal sets, polyblocks and monotonic optimization. Vietnam J Math 27(4):277–300

    MATH  MathSciNet  Google Scholar 

  10. Tuy H (2000) Monotonic optimization: Problems and solution approaches. SIAM J Optim 11(2):464–494

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute Math., Hanoi, Vietnam

    Hoang Tuy

Authors
  1. Hoang Tuy
    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

Tuy, H. (2008). Cutting Plane Methods for Global Optimization . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_104

Download citation

Publish with us

Policies and ethics

Search

Navigation