A direct heuristic algorithm for linear programming
From MaRDI portal
Publication:1971659
DOI10.1007/BF02829483zbMath0947.90069MaRDI QIDQ1971659
Publication date: 23 March 2000
Published in: Proceedings of the Indian Academy of Sciences. Mathematical Sciences (Search for Journal in Brave)
interior-point methodsrevised simplex algorithmoptimality test\(p\)-inversedirect heuristic algorithm for linear programming
Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51)
Uses Software
Cites Work
- Error-free matrix symmetrizers and equivalent symmetric matrices
- A new polynomial-time algorithm for linear programming
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
- Computing a matrix symmetrizer exactly using modified multiple modulus residue arithmetic
- A polynomial-time algorithm, based on Newton's method, for linear programming
- A center of a polytope: An expository review and a parallel implementation
- On continuity of the Moore-Penrose and Drazin generalized inverses
- Solving linear programming problems exactly
- An inequality sorting algorithm for a class of linear programming problems
- A variation on Karmarkar’s algorithm for solving linear programming problems
- An extended set of FORTRAN basic linear algebra subprograms
- Optimal iterative schemes for computing the Moore-Penrose matrix inverse
- Rank-Augmented LU-Algorithm for Computing Generalized Matrix Inverses
- On the Continuity of the Generalized Inverse
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- The least squares problem and pseudo-inverses
- The Pseudoinverse of a Rectangular or Singular Matrix and Its Application to the Solution of Systems of Linear Equations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A direct heuristic algorithm for linear programming
