The factorization approach to large-scale linear programming
From MaRDI portal
Publication:4096702
DOI10.1007/BF01580655zbMath0331.90036OpenAlexW2006752333MaRDI QIDQ4096702
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
Related Items
Dynamic factorization in large-scale optimization, Descent direction algorithm with multicommodity flow problem for signal optimization and traffic assignment jointly, Modeling of building evacuation problems by network flows with side constraints, Exploiting special structure in Karmarkar's linear programming algorithm, 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, Unnamed Item, Automatic identification of embedded network rows in large-scale optimization models, A specialized network simplex algorithm for the constrained maximum flow problem, A bump triangular dynamic factorization algorithm for the simplex method, Testing of a large-scale network optimization program, Hidden Z-matrices with positive principal minors, Large-scale linear programming: Geometry, working bases and factorizations, Basis properties and algorithmic specializations for GUB transformed networks, Solving embedded generalized network problems, Representing inverses in pure network flow optimization, Extracting embedded generalized networks from linear programming problems
Cites Work
- Unnamed Item
- Unnamed Item
- Generalized upper bounding techniques
- An Artificial-Variable Elimination Method for Solving Block-Diagonal Programming Problems
- A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
- A complete constructive algorithm for the general mixed linear programming problem
- Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
- Reinversion with the preassigned pivot procedure
- A generalized upper bounding method for doubly coupled linear programs
