Solving linear programming problems exactly
From MaRDI portal
Publication:1354256
DOI10.1016/0096-3003(95)00309-6zbMath0872.65047MaRDI QIDQ1354256
Seenith Sivasundaram, Syamal K. Sen, A. K. Maulloo, Vangipuram Lakshmikantham
Publication date: 5 May 1997
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0096-3003(95)00309-6
Related Items
Open problems in computational linear algebra, \(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation., Special issue: Lakshmikantham's legacy: a tribute on his 75th birthday, A brief biography and survey of collected works of V. Lakshmikantham, A direct heuristic algorithm for linear programming, Best \(k\)-digit rational bounds for irrational numbers: pre- and super-computer era, \(2^n\) in scientific computation and beyond
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- An inequality sorting algorithm for a class of linear programming problems
- An approach to nonlinear programming
- Optimal iterative schemes for computing the Moore-Penrose matrix inverse
- Branch and Bound Methods for Mathematical Programming Systems
- An Explicit Solution of a Special Class of Linear Programming Problems
- The Pseudoinverse of a Rectangular or Singular Matrix and Its Application to the Solution of Systems of Linear Equations