Skip to main content
SpringerLink
Log in

MINLP: Generalized Cross Decomposition

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Keywords

The Problem

The Primal Master Problem

The Dual Master Problem

The Subproblems

The Cross Decomposition Algorithm

The Convergence Tests

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. Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numerische Math 4:238–252

    Article  MathSciNet  MATH  Google Scholar 

  2. Dantzig GB (1963) Linear programming and extensions. Princeton Univ. Press, Princeton

    MATH  Google Scholar 

  3. Dantzig GB, Wolfe P (1960) Decomposition principle for linear programs. Oper Res 8:101–111

    Article  MATH  Google Scholar 

  4. Floudas CA (1995) Nonlinear and mixed-integer optimization: Fundamentals and applications. Oxford Univ. Press, Oxford

    MATH  Google Scholar 

  5. Geoffrion AM (1972) Generalized Benders decomposition. J Optim Th Appl 10:237–260

    Article  MathSciNet  MATH  Google Scholar 

  6. Holmberg K (1985) Decomposition in large scale mathematical programming. PhD Thesis Dept. Math. Linköping Univ.

    Google Scholar 

  7. Holmberg K (1990) On the convergence of cross decomposition. Math Program 47:269–296

    Article  MathSciNet  MATH  Google Scholar 

  8. Holmberg K (1992) Generalized cross decomposition applied to nonlinear integer programming problems: Duality gaps and convexification in parts. Optim 23:341–356

    Article  MathSciNet  MATH  Google Scholar 

  9. Holmberg K (1994) Cross decomposition applied to integer programming problems: Duality gaps and convexification in parts. Oper Res 42(4):657–668

    Article  MathSciNet  MATH  Google Scholar 

  10. Holmberg K, Jörnsten K (1984) Cross decomposition applied to the stochastic transportation problem. Europ J Oper Res 17:361–368

    Article  MATH  Google Scholar 

  11. Van Roy TJ (1983) Cross decomposition for mixed integer programming. Math Program 25:46–63

    Article  MathSciNet  MATH  Google Scholar 

  12. Van Roy TJ (1986) A cross decomposition algorithm for capacitated facility location. Oper Res 34:145–163

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department Math., Linköping Institute Technol., Linköping, Sweden

    Kaj Holmberg

Authors
  1. Kaj Holmberg
    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

Holmberg, K. (2008). MINLP: Generalized Cross Decomposition . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_380

Download citation

Publish with us

Policies and ethics

Search

Navigation