The factorization approach to large-scale linear programming
From MaRDI portal
Publication:4096702
DOI10.1007/BF01580655zbMATH Open0331.90036OpenAlexW2006752333MaRDI QIDQ4096702FDOQ4096702
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
Cites Work
- Title not available (Why is that?)
- Generalized upper bounding techniques
- Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
- Title not available (Why is that?)
- A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
- Reinversion with the preassigned pivot procedure
- A generalized upper bounding method for doubly coupled linear programs
- A complete constructive algorithm for the general mixed linear programming problem
- An Artificial-Variable Elimination Method for Solving Block-Diagonal Programming Problems
Cited In (17)
- Hidden Z-matrices with positive principal minors
- Solving embedded generalized network problems
- Dynamic factorization in large-scale optimization
- Testing of a large-scale network optimization program
- A specialized network simplex algorithm for the constrained maximum flow problem
- Extracting embedded generalized networks from linear programming problems
- Automatic identification of embedded network rows in large-scale optimization models
- Post-optimality analysis of the optimal solution of a degenerate linear program using a pivoting algorithm
- Modeling of building evacuation problems by network flows with side constraints
- A network-related nuclear power plant model with an intelligent branch- and-bound solution approach
- Basis properties and algorithmic specializations for GUB transformed networks
- Representing inverses in pure network flow optimization
- A bump triangular dynamic factorization algorithm for the simplex method
- Exploiting special structure in Karmarkar's linear programming algorithm
- Descent direction algorithm with multicommodity flow problem for signal optimization and traffic assignment jointly
- Large-scale linear programming: Geometry, working bases and factorizations
- Multicommodity network flows: A survey. II: Solution methods
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)
