Skip to main content
SpringerLink
Log in

Sequential Cutting Plane Algorithm

  • Reference work entry
Encyclopedia of Optimization

  • 192 Accesses

Article Outline

Keywords and Phrases

Formulation

Methods

  Branch and Bound

  NLP Iteration

  Algorithm Pseudo-Code

Cases

Conclusions

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

Similar content being viewed by others

References

  1. Bussieck MR, Pruessner A (2003) Mixed-Integer Nonlinear Programming. SIAG/OPT Newsl Views-and-News 14:19–22

    Google Scholar 

  2. Castillo I, Westerlund J, Emet S, Westerlund T (2005) Optimization of Block Layout Design Problems with Unequal Areas: A Comparison of MILP and MINLP Optimization Methods. Comput Chem Eng 30:54–69

    Google Scholar 

  3. Dolan ED, Moré JJ (2002) Benchmarking Optimization Software with Performance Profiles. Math Program 91:201–213

    Article  MathSciNet  MATH  Google Scholar 

  4. Land AH, Doig AG (1960) An Automatic Method of Solving Discrete Programming Problems. Econom 28:497–520

    Article  MathSciNet  MATH  Google Scholar 

  5. Quesada I, Grossmann IE (1992) An LP/NLP Based Branch and Bound Algorithm for Convex MINLP Optimization Problems. Comput Chem Eng 16:937–947

    Article  Google Scholar 

  6. Still C, Westerlund T (2006) A Sequential Cutting Plane Algorithm for Solving Convex NLP Problems. Eur J Oper Res 173:444–464

    Article  MathSciNet  MATH  Google Scholar 

  7. Still C, Westerlund T (2006) Solving Convex MINLP Optimization Problems Using a Sequential Cutting Plane Algorithm. Comput Optim Appl 34:63–83

    Article  MathSciNet  MATH  Google Scholar 

  8. Still C, Westerlund T (2007) A Linear Programming-Based Optimization Algorithm for Solving Nonlinear Programming Problems. Eur J Oper Res (submitted)

    Google Scholar 

  9. Westerlund T, Pörn R (2002) Solving Pseudo-Convex Mixed Integer Optimization Problems by Cutting Plane Techniques. Optim Eng 3:253–280

    Article  MathSciNet  MATH  Google Scholar 

  10. Westerlund T, Skrifvars H, Harjunkoski I, Pörn R (1998) An Extended Cutting Plane Method for a Class of Non-Convex MINLP Problems. Comput Chem Eng 22:357–365

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Process Design Laboratory, Åbo Akademi University, Åbo, Finland

    Claus Still & Tapio Westerlund

Authors
  1. Claus Still
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tapio Westerlund
    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

Still, C., Westerlund, T. (2008). Sequential Cutting Plane Algorithm . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_596

Download citation

Publish with us

Policies and ethics

Search

Navigation