The factorization approach to large-scale linear programming

DOI10.1007/BF01580655MaRDI QIDQ4096702zbMATH OpenOpenAlexFDO

Authors Glenn W. Graves, Richard D. McBride

Publication date 1976

Published in Mathematical Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Linear programming (90C05)

Cites work

• A complete constructive algorithm for the general mixed linear programming problem
• A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
• A generalized upper bounding method for doubly coupled linear programs
• An Artificial-Variable Elimination Method for Solving Block-Diagonal Programming Problems
• Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
• Generalized upper bounding techniques
• scientific article; zbMATH DE number 3356467 (Why is no real title available?)
• scientific article; zbMATH DE number 3197060 (Why is no real title available?)
• Reinversion with the preassigned pivot procedure

Cited in

(17)

• Solving embedded generalized network problems
• Representing inverses in pure network flow optimization
• Modeling of building evacuation problems by network flows with side constraints
• Exploiting special structure in Karmarkar's linear programming algorithm
• Hidden Z-matrices with positive principal minors
• Dynamic factorization in large-scale optimization
• Descent direction algorithm with multicommodity flow problem for signal optimization and traffic assignment jointly
• Automatic identification of embedded network rows in large-scale optimization models
• Large-scale linear programming: Geometry, working bases and factorizations
• Extracting embedded generalized networks from linear programming problems
• A bump triangular dynamic factorization algorithm for the simplex method
• Testing of a large-scale network optimization program
• Multicommodity network flows: A survey. II: Solution methods
• A specialized network simplex algorithm for the constrained maximum flow problem
• Basis properties and algorithmic specializations for GUB transformed networks
• Post-optimality analysis of the optimal solution of a degenerate linear program using a pivoting algorithm
• A network-related nuclear power plant model with an intelligent branch- and-bound solution approach

This page was built for publication: The factorization approach to large-scale linear programming

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