Advertisement

Decomposition methods using compound proposals for large-scale optimization

  • Vladimir E. Krivonozhko
II Mathematical Programming II.3 Linear Programming And Complementarity
Part of the Lecture Notes in Control and Information Sciences book series (LNCIS, volume 180)

Abstract

The approach presented here allows us to unite some advantages of the decomposition and basis factorization. First, we have a freedom to some extent to iterate in the master as in the decomposition methods. Second, the solution path goes similar to the one of the basis factorization. It also enables us to view the decomposition and basis factorization from a unifying position. The approach seems to be promising for parallel computations.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Benders, J.F. (1962) Partitioning procedures for solving mixed variables programming problems. Numerische Mathematik 4, 238–252.zbMATHCrossRefMathSciNetGoogle Scholar
  2. [2]
    Dantzig, G. B. and Wolfe, P. (1960) The decomposition principler for linear programs. Operations Research 8, 101–111.zbMATHGoogle Scholar
  3. [3]
    Dantzig, G. B. and Van-Slyke, R.M. (1967) Generalized upper bounding techniques for linear programming. Journal of Computer and System Sciences 1, N 3, 213–226.zbMATHMathSciNetGoogle Scholar
  4. [4]
    Geoffrion, A. (1970) Elements of large-scale mathematical programming. Management Sciences 16, 652–691.MathSciNetCrossRefGoogle Scholar
  5. [5]
    Grigoriadis, M.D. (1973) Unified pivoting procedures for large structured linear systems and programs. In Decomposition of Large-Scale Problems, D.M. Himmilblau, ed., North-Holland, 447–465.Google Scholar
  6. [6]
    Ho, J.K. (1987) Recent advances in the decomposition approach to linear programming. Mathematical Programming Study 31, 119–127.zbMATHGoogle Scholar
  7. [7]
    Kallio, M.J. (1975) On large-scale linear programming. Systems Optimization Laboratory, Stanford University, Technical Report SOL 75-7, Stanford, CA.Google Scholar
  8. [8]
    Krivonozhko, V.E. (1991) On comparison of solution trajectories between Dantzig-Wolfe decomposition and basis factorization. Optimization Methods and Software, to appear.Google Scholar
  9. [9]
    Murtagh, B.A. and Saunders, M.A. (1978) Large-scale linear constrained optimization. Mathematical Programming 14, 41–72.zbMATHCrossRefMathSciNetGoogle Scholar
  10. [10]
    Murtagh, B.A. and Saunders, M.A. (1981) A projected lagrangian algorithm and its implementation for sparse nonlinear constraints. Technical Report Sol 80-1R, Stanford University, California.Google Scholar
  11. [11]
    Winkler, C. (1974) Basis factorization for block-angular linear programs: unified theory of partitioning and decomposition using the simplex method. Research Report 74-22, IIASA, Laxenburg, Austria.zbMATHGoogle Scholar

Copyright information

© International Federation for Information Processing 1992

Authors and Affiliations

  • Vladimir E. Krivonozhko
    • 1
  1. 1.Institute for Systems StudiesMoscow B-312USSR

Personalised recommendations