The basis suppression method

DOI10.1007/BF02216931zbMath0705.90055OpenAlexW1973546017MaRDI QIDQ918407

Richard V. Helgason, Bruce W. Patty

Publication date: 1989

Published in: Annals of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

proof of convergencebasis suppression algorithmmaximal concurrent flow problem

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Primal partition programming for block diagonal matrices
• Special simplex algorithm for multi-sector problems
• A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
• Spike swapping in basis reinversion
• A product form representation of the inverse of a multicommodity cycle matrix
• New Finite Pivoting Rules for the Simplex Method
• An Approach to Some Structured Linear Programming Problems
• Reinversion with the preassigned pivot procedure
• A generalized upper bounding method for doubly coupled linear programs
• A generalized upper bounding algorithm for multicommodity network flow problems

This page was built for publication: The basis suppression method