Karmarkar's projective algorithm: A null space variant for multi- commodity generalized networks

DOI10.1007/BF01539488zbMath0636.90030MaRDI QIDQ1098761

B. George

Publication date: 1985

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

zbMATH Keywords

large scale generalized multicommodity networksprojective algorithm of Karmarkar

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Deterministic network models in operations research (90B10)

Uses Software

• symrcm

Cites Work

• A new polynomial-time algorithm for linear programming
• Solution of sparse linear least squares problems using Givens rotations
• A direct method for the solution of sparse linear least squares problems
• Singular value decomposition and least squares solutions
• A Comparison of Some Methods for Solving Sparse Linear Least-Squares Problems
• An experimental approach to karmarkar’s projective method for linear programming
• Complexity and computability of solutions to linear programming systems
• Solution of Large-Scale Sparse Least Squares Problems Using Auxiliary Storage
• Some Extensions of an Algorithm for Sparse Linear Least Squares Problems
• On the Generalized Inverse of an Incidence Matrix
• Generalized Inverses of Partitioned Matrices
• The least squares problem and pseudo-inverses
• On the equivalence of some generalized network problems to pure network problems
• Contributions to the Theory of Generalized Inverses
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Karmarkar's projective algorithm: A null space variant for multi- commodity generalized networks