Skip to main content

Decomposition of Structured Linear Programs Based on Analytical Centers

  • Conference paper
Decision Processes in Economics

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 353))

Abstract

The aim of this paper is to review the celebrated decomposition scheme of Dantzig and Wolfe and to explain how it can be modified in view of a more efficient implementation based on analytical centers. Our purpose here is mainly didactic: we seek to provide a non technical introduction to the subject matter.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. B. Dantzig et P. Wolfe, “The decomposition algorithm for linear programming”, Econometrica 29 (4), (1961), 767–778.

    Article  Google Scholar 

  2. J.-L. Goffin, A. Haurie et J.-P. Vial, “Decomposition and nondifferentiable optimization with the projective algorithm”, manuscript, Département d’économie commerciale et industrielle, University of Geneva (July 1989).

    Google Scholar 

  3. J.-l. Goffin et J.-P. Vial, “Cutting planes and column generation techniques with the projective algorithm”, manuscript, Département d’économie commerciale et industrielle, University of Geneva (1988), to appear in Journal of Optimization Theory and Applications.

    Google Scholar 

  4. G. Sonnevend, “An analytical center for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming”’, in Lecture Notes in Control and Information Sciences 84 (Springer, New York, 1985) 866–876.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vial, JP. (1991). Decomposition of Structured Linear Programs Based on Analytical Centers. In: Ricci, G. (eds) Decision Processes in Economics. Lecture Notes in Economics and Mathematical Systems, vol 353. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45686-2_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-45686-2_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53592-8

  • Online ISBN: 978-3-642-45686-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics