Solving linear program as linear system in polynomial time
From MaRDI portal
Publication:552124
DOI10.1016/j.mcm.2010.11.065zbMath1217.90138OpenAlexW2087183652MaRDI QIDQ552124
Syamal K. Sen, Ravi P. Agarwal, Suja Ramakrishnan
Publication date: 21 July 2011
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mcm.2010.11.065
linear systemlinear program\texttt{Matlab} programBarnes algorithmerror-free computationpolynomial-time iterative-cum-non-iterative algorithm
Numerical mathematical programming methods (65K05) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05)
Uses Software
Cites Work
- A new polynomial-time algorithm for linear programming
- Solving linear programming problems exactly
- Computational error and complexity in science and engineering
- Chemical equation balancing: an integer programming approach
- A variation on Karmarkar’s algorithm for solving linear programming problems
- Optimal iterative schemes for computing the Moore-Penrose matrix inverse
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Solving linear program as linear system in polynomial time