Skip to main content
SpringerLink
Log in
Book cover

Mathematical Programming Essays in Honor of George B. Dantzig Part I pp 43–64Cite as

A dantzig-wolfe decomposition variant equivalent to basis factorization

  • Chapter
  • First Online:

Part of the book series: Mathematical Programming Studies ((MATHPROGRAMM,volume 24))

Abstract

A variant of Dantzig-Wolfe decomposition and basis factorization are compared as solution techniques for block angular systems. It is shown that the two methods follow the same solution path to the optimum. The result has implications for the use of decomposition and factorization algorithms together.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W.J. Baumol and T. Fabian, “Decomposition, pricing for decentralization and external economies”, Management Science 11 (1964) 1–32.

    Article  Google Scholar 

  2. J. R. Birge, “The relationship between the L-shaped method and dual basis factorization for stochastic linear programming”, Department of Industrial and Operations Engineering, The University of Michigan, Technical Report 82-15 (Ann Arbor, MI, 1982).

    Google Scholar 

  3. R.G. Bland, “New finite pivoting rules for the simplex method”, Mathematics of Operations Research 2 (1977) 103–107.

    Article  MATH  MathSciNet  Google Scholar 

  4. W.H. Cunningham, “Theoretical properties of the network simplex method”, Mathematics of Operations Research 4 (1979) 196–208.

    Article  MATH  MathSciNet  Google Scholar 

  5. G.B. Dantzig, “Upper bounds, secondary constraints, and block triangularity in linear programming”, Econometrica 23 (1955) 174–183.

    Article  MATH  MathSciNet  Google Scholar 

  6. G.B. Dantzig and P. Wolfe, “The decomposition principle for linear programs”, Operations Research 8 (1960) 101–111.

    Article  MATH  Google Scholar 

  7. A. Geoffrion, “Elements of large-scale mathematical programming, Part I: Concepts”, Management Science 16 (1970) 652–675.

    Article  MathSciNet  Google Scholar 

  8. J.K. Ho, “Convergence behavior of decomposition algorithms for linear programs”, College of Business Administration, Univesity of Tennessee, Working Paper No. 179 (Knoxville, TN, 1984), also Operations Research Letters 3 (1984) 91–94.

    Google Scholar 

  9. M.J. Kallio, “On large-scale linear programming”, Systems Optimization Laboratory, Stanford University, Technical Report SOL 75-7 (Stanford, CA, 1975).

    Google Scholar 

  10. M. Kallio and E.L. Porteus, “A note on the relation between the generalized GUB-technique and Dantzig-Wolfe decomposition”, Graduate School of Business, Stanford University, Research Paper No. 265 (Stanford, CA, 1975).

    Google Scholar 

  11. C. Winkler, “Basis factorization for block-angular linear programs: unified theory of partition and decomposition using the simplex method”, Systems Optimization Laboratory, Stanford University, Technical Report SOL 74-19 (Stanford, CA, 1974).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Deparment of Industrial and Operations Engineering, The University of Michigan, 48109, Ann Arbor, MI, USA

    J. R. Birge

Authors
  1. J. R. Birge
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

R. W. Cottle

Additional information

Dedicated to Professor George B. Dantzig on the occasion of his seventieth birthday

Rights and permissions

Reprints and permissions

Copyright information

© 1985 The Mathematical Programming Society, Inc.

About this chapter

Cite this chapter

Birge, J.R. (1985). A dantzig-wolfe decomposition variant equivalent to basis factorization. In: Cottle, R.W. (eds) Mathematical Programming Essays in Honor of George B. Dantzig Part I. Mathematical Programming Studies, vol 24. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0121042

Download citation

  • DOI: https://doi.org/10.1007/BFb0121042

  • Received:

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00918-1

  • Online ISBN: 978-3-642-00919-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation