Large-scale linear programming: Geometry, working bases and factorizations

DOI10.1007/BF02591889zbMath0516.90051OpenAlexW1984301308WikidataQ114233774 ScholiaQ114233774MaRDI QIDQ3664825

Michael J. Todd

Publication date: 1983

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02591889

zbMATH Keywords

geometrysimplex methodmatrix factorizationsdecomposition principlecompact bases

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Linear programming (90C05)

Related Items (5)

Dynamic factorization in large-scale optimization ⋮ On solution of multicoupled models ⋮ Solving large-scale linear programs by aggregation ⋮ Price-directive decomposition applied to routing in telecommunication networks ⋮ Stable modification of explicitLU factors for simplex updates

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized upper bounding techniques
• A stabilization of the simplex method
• A numerically stable form of the simplex algorithm
• The Elimination form of the Inverse and its Application to Linear Programming
• The Decomposition Algorithm for Linear Programs
• A bump triangular dynamic factorization algorithm for the simplex method
• An implementation of the simplex method for linear programming problems with variable upper bounds
• A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
• Solving Constrained Transportation Problems
• The factorization approach to large-scale linear programming
• Methods for Computing and Modifying the LDV Factors of a Matrix
• A primal algorithm for solving a capacitated network flow problem with additional linear constraints
• Triangular Factorization and Generalized Upper Bounding Techniques
• Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
• A Survey of Linear Cost Multicommodity Network Flows
• Multicommodity network flows—A survey
• Implicit representation of generalized variable upper bounds in linear programming
• Large-scale linearly constrained optimization
• Solving the Generalized Transportation Problem with Constraints
• A note on Schrage's generalised variable upper bounds
• Technical Note—Generalized Upper Bounds and Triangular Decomposition in the Simplex Method
• Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
• Updated triangular factors of the basis to maintain sparsity in the product form simplex method
• An Explicit Solution of a Special Class of Linear Programming Problems
• A partitioning algorithm for the multicommodity network flow problem
• A generalized upper bounding algorithm for multicommodity network flow problems
• Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm

This page was built for publication: Large-scale linear programming: Geometry, working bases and factorizations