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

DOI10.1007/BF02591889MaRDI QIDQ3664825zbMATH OpenOpenAlexWikidataFDO

Authors 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

geometrymatrix factorizationssimplex methoddecomposition principlecompact bases

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(5)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3664825)