Polynomial-time dual algorithms in linear programming

Yu. E. Nesterov

Type: Article

Publication Date: 1989-01-01

Citations: 1

DOI: https://doi.org/10.1007/bf01074882

Similar Works

Action	Title	Year	Authors
+	Polynomial algorithms in linear programming	1980	Leonid Khachiyan
+	Polynomial time algorithms for linear programming	2006	S.M. Sinha
+	Linear Programming Algorithms	2005
+	Linear Programming Algorithms	2007
+	Linear Programming Algorithms	1997	Yinyu Ye
+	Polynomial time algorithms for linear and integer programming	2000	Chi-kwan Chu
+	Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming	1987	Yinyu Ye Masakazu Kojima
+	Polynomial Algorithms—Linear Programming	1988	Robert Parker Ronald L. Rardin
+	Polynomial algorithms for a class of linear programs	1981	Jean François Maurras Klaus Truemper Mustafa Akgül
+	LP-relaxations for polynomial optimization	2015	Jean B. Lasserre
+	Linear Programming and Approximation Problems	1961	L. E. Ward
+	Linear Programming and Duality	1972
+	Linear Programming and Duality	2020
+	A simple complexity proof for a polynomial-time linear programming algorithm	1989	Paul Tseng
+	Computational Problems in Linear Programming	1953	John S. Chipman
+ PDF Chat	Optima of dual integer linear programs	1988	Ron Aharoni Paul Erdős Nathan Linial
+	Algorithm for Linear Programming	2014	Iosr Journals Anand Mohan Sinha
+	An efficient algorithm for linear programming	1990	V. Ch. Venkaiah
+	A polynomial projection algorithm for linear feasibility problems	2014	Sergei Chubanov
+	Computational Complexity of Linear Programming	2011

Action	Title	Year	Authors
+	Bibliography	1997	Yinyu Ye

Action	Title	Year	Authors
+	HOW GOOD IS THE SIMPLEX ALGORITHM	1970	Victor Klee George J. Minty
+	A polynomial-time algorithm, based on Newton's method, for linear programming	1988	James Renegar
+	An extension of Karmarkar's algorithm for linear programming using dual variables	1986	Michael J. Todd Bruce P. Burrell