Pages that link to "Item:Q1824548"
From MaRDI portal
The following pages link to A simple complexity proof for a polynomial-time linear programming algorithm (Q1824548):
Displaying 6 items.
- Solving linear program as linear system in polynomial time (Q552124) (← links)
- A proof of the polynomiality of the Iri-Imai method (Q1260658) (← links)
- On the number of iterations of Karmarkar's algorithm for linear programming (Q1321670) (← links)
- Interior dual proximal point algorithm for linear programs (Q1333478) (← links)
- An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution (Q1915904) (← links)
- A simple polynomial-time rescaling algorithm for solving linear programs (Q5900037) (← links)