Solving linear program as linear system in polynomial time
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 2184875 (Why is no real title available?)
- scientific article; zbMATH DE number 3874496 (Why is no real title available?)
- scientific article; zbMATH DE number 2169896 (Why is no real title available?)
- scientific article; zbMATH DE number 2169903 (Why is no real title available?)
- scientific article; zbMATH DE number 3373921 (Why is no real title available?)
- scientific article; zbMATH DE number 3111121 (Why is no real title available?)
- A new polynomial-time algorithm for linear programming
- A variation on Karmarkar’s algorithm for solving linear programming problems
- Chemical equation balancing: an integer programming approach
- Computational error and complexity in science and engineering
- Concise algorithm for linear programs in \texttt{Matlab}: monotonic convergence, basic variables, boundedness
- Optimal iterative schemes for computing the Moore-Penrose matrix inverse
- Solving linear programming problems exactly
Cited in
(4)- Concise algorithm for linear programs in \texttt{Matlab}: monotonic convergence, basic variables, boundedness
- \(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation.
- Linear programming: recent advances
- Solving Linear Programs in the Current Matrix Multiplication Time
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)