Skip to main content
SpringerLink
Log in

Extended Cutting Plane Algorithm

  • Reference work entry
Encyclopedia of Optimization

  • 504 Accesses

Article Outline

Keywords and Phrases

Introduction

Formulation

Methods

  Calculating Sufficiently Large α-values

  Handling Infeasible MILP Problems

Convergence

  Cycling

  Convergence to a Feasible Point

  Convergence to the Optimal Solution

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. Adjiman CS, Androulakis IP, Floudas CA (1997) Global optimization of MINLP problems in process synthesis and design. Comput Chem Eng 21:445–450

    Article  Google Scholar 

  2. Androulakis IP, Maranas CD, Floudas CA (1995) α-BB: A global optimization method for general constrained nonconvex problems. J Glob Optim 7:337–363

    Article  MATH  MathSciNet  Google Scholar 

  3. 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 

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

    Article  MATH  MathSciNet  Google Scholar 

  5. Fletcher R, Leyffer S (1994) Solving mixed integer nonlinear programs by outer approximation. Math Program 66:327–349

    Google Scholar 

  6. Floudas CA (1995) Nonlinear and mixed-integer optimization, fundamentals and applications. Oxford University Press, Oxford

    MATH  Google Scholar 

  7. Geoffrion AM (1972) Generalized Benders Decomposition. J Optim Theory Appl 10:237–260

    Article  MATH  MathSciNet  Google Scholar 

  8. 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 

  9. Ryoo HS, Sahinidis NV (1995) Global optimization of nonconvex NLPs and MINLPs with applications in process design. Comput Chem Eng 19:551–566

    Article  Google Scholar 

  10. Still C, Westerlund T (2006) Solving convex MINLP optimization problems using a sequential cutting plane algorithm. Comput Optim Appl 34:63–83

    Article  MATH  MathSciNet  Google Scholar 

  11. Viswanathan J, Grossmann IE (1990) A combined penalty function and outer-approximation method for MINLP optimization. Comput Chem Eng 14:769–782

    Article  Google Scholar 

  12. Visweswaran V, Floudas CA (1996) New formulations and branching strategies for the GOP algorithm. In: Grossmann IE (ed) Global Optimization in Engineering Design. Kluwer, Dordrecht, pp 75–109

    Google Scholar 

  13. Westerlund T, Pörn R (2002) Solving pseudo-convex mixed integer optimization problems by cutting plane techniques. Optim Eng 3:253–280

    Article  MATH  MathSciNet  Google Scholar 

  14. 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 

  15. Westerlund T (2006) Some transformation techniques in global optimization. In: Liberti L, Maculan N (eds) Global Optimization, From Theory to Implementation. Springer, Berlin, pp 45–74

    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). Extended 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_168

Download citation

Publish with us

Policies and ethics

Search

Navigation