Skip to main content
SpringerLink
Log in

Mixed-Integer Nonlinear Optimization: A Disjunctive Cutting Plane Approach

  • Reference work entry
Encyclopedia of Optimization

  • 168 Accesses

Article Outline

Keywords

Introduction

Formulation

Branch-And-Cut Procedure

Linear Approximation of NLP Relaxation

Disjunctive Cut Generation

Cut Lifting

Conclusion

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. Balas E, Ceria S, Cornuejols G (1993) A lift-and-project cutting plane algorithm for mixed-integer 0–1 programs. Math Program 58:295–324

    Article  MathSciNet  Google Scholar 

  2. Balas E, Ceria S Cornuejols G (1996) Mixed 0–1 programming by lift-and-project in a branch-and-cut framework. Manag Sci 42:1229–1246

    Article  MATH  Google Scholar 

  3. Duran MA, Grossmann IE (1986) An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math Program 36:307–339

    Article  MathSciNet  MATH  Google Scholar 

  4. Floudas CA (1995) Nonlinear and mixed-integer optimization, fundamentals and applications. Oxford Univ Press, New York

    MATH  Google Scholar 

  5. Floudas CA (2005) Research challenges, opportunities and synergism in systems engineering and computational biology. AIChE J 51:1872–1884

    Article  Google Scholar 

  6. Grossman IE, Westerberg AW (2000) Research challenges in process systems engineering. AIChE J 46:1700–1703

    Article  Google Scholar 

  7. Lovasz L, Schrijver A (1991) Cones of matrices and set functions and 0–1 optimization. SIAM J Optim 1:166–190

    Article  MathSciNet  MATH  Google Scholar 

  8. Sherali H, Adams W (1990) A hierarchy of relaxations between the continuous and convex hull representation for zero-one programming problems. SIAM J Discret Math 3:411–430

    Article  MathSciNet  MATH  Google Scholar 

  9. Stubbs RA, Mehrotra S (1999) A branch-and-cut method for 0–1 mixed convex programming. Math Program 86:515–532

    Article  MathSciNet  MATH  Google Scholar 

  10. Zhu Y, Kuno T (2003) Global optimization of nonconvex MINLP by a hybrid branch-and-bound and revised general Benders decomposition method. Ind Eng Chem Res 42:528–539

    Article  Google Scholar 

  11. Zhu Y, Kuno T (2006) A disjunctive cutting plane based branch-and-cut algorithm for 0–1 mixed-integer nonlinear programs. Ind Eng Chem Res 45:187–196

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Chemical Engineering, Tsinghua University, Beijing, China

    Yushan Zhu

Authors
  1. Yushan Zhu
    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

Zhu, Y. (2008). Mixed-Integer Nonlinear Optimization: A Disjunctive Cutting Plane Approach . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_393

Download citation

Publish with us

Policies and ethics

Search

Navigation