Solving linear program as linear system in polynomial time
DOI10.1016/J.MCM.2010.11.065zbMATH Open1217.90138OpenAlexW2087183652MaRDI QIDQ552124FDOQ552124
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
Recommendations
- Concise algorithm for linear programs in \texttt{Matlab}: monotonic convergence, basic variables, boundedness
- A new polynomial-time algorithm for linear programming
- Linear programming: recent advances
- scientific article; zbMATH DE number 4016589
- A simple complexity proof for a polynomial-time linear programming algorithm
linear systemlinear program\texttt{Matlab} programBarnes algorithmerror-free computationpolynomial-time iterative-cum-non-iterative algorithm
Numerical mathematical programming methods (65K05) Linear programming (90C05) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- A new polynomial-time algorithm for linear programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Chemical equation balancing: an integer programming approach
- Optimal iterative schemes for computing the Moore-Penrose matrix inverse
- Solving linear programming problems exactly
- Computational error and complexity in science and engineering
- Title not available (Why is that?)
- Title not available (Why is that?)
- A variation on Karmarkar’s algorithm for solving linear programming problems
- Title not available (Why is that?)
Cited In (3)
Uses Software
This page was built for publication: Solving linear program as linear system in polynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q552124)
