Potential Function Methods for Approximately Solving Linear Programming Problems

Type: Book

Publication Date: 2002-01-01

Citations: 13

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

View Chat PDF

Kluwer Academic Publishers eBooks - View
Library Union Catalog of Bavaria, Berlin and Brandenburg (B3Kat Repository) - View - PDF

Similar Works

Action	Title	Year	Authors
+	Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice	2002	Daniel Bienstock
+	Barrier function algorithms for linear and convex quadratic programming	1988	Mohamed Ben‐Daya
+ PDF Chat	Potential-reduction methods in mathematical programming	1997	Michael J. Todd
+	Linear Programming	2022	Ding‐Zhu Du Pãnos M. Pardalos Xiao Hu Weili Wu
+	Linear programming methods and applications	1990	H. Arsham
+	Linear programming methods and application	1961	Bob R. Holdren Saul I. Gass
+ PDF Chat	Solving linear programming problem using approximate optimization method	2022	Nadia Ali Abbas Almosa Ahmed Sabah Al-Jilawi
+	Optimization and linear programming	2011	K. A. Stroud Dexter Booth
+	Optimization and Linear Programming	2006
+	The Approximation Of Nonlinear Programming Problems Using Linear Programming	1986	Jeffrey Apland
+	Computational Methods For Linear Programming	1994	David F. Shanno
+	Potential Reduction Methods for Linear Programming	2012	Yinyu Ye
+	Potential Reduction Methods for Linear Programming	2001	Yinyu Ye
+	Potential Reduction Methods for Linear Programming	2008	Yinyu Ye
+	Introduction to Linear Optimization	2023	Arkadi Nemirovski
+	Introduction to linear optimization	1997	Dimitris Bertsimas John N. Tsitsiklis
+	Linear Programming Using MATLAB®	2017	Νικόλαος Πλόσκας Nikolaos Samaras
+	Linear Programming	2024
+	Solving Linear Optimization Problems	2013
+	Algorithms for Linear-Quadratic Optimization	2021	Vasile Sima

Action	Title	Year	Authors
+	Unconstrained Convex Minimization in Relative Scale	2003	Yurii Nesterov
+	First-order algorithm with $${\mathcal{O}({\rm ln}(1{/}\epsilon))}$$ convergence for $${\epsilon}$$ -equilibrium in two-person zero-sum games	2010	Andrew R. Gilpin Javier Peña Tüomas Sandholm
+	Rounding of Convex Sets and Efficient Gradient Methods for Linear Programming Problems	2004	Yurii Nesterov
+	A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location Problem	2011	Simon Görtz Andreas Klose

Action	Title	Year	Authors