Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Ilan Adler
Information about the author Ilan Adler will soon be added to the site.
Found
10 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
The equivalence of linear programs and zero‐sum games
2013
In 1951, Dantzig showed the equivalence of linear programming problems and...
Baseball, optimization, and the World Wide Web
2002
The competition for baseball play-off spots – the fabled pennant race – is...
A geometric view of parametric linear programming
1992
We present a new definition of optimality intervals for the parametric right-hand side...
A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio
1993
The authors extend Clarkson's randomized algorithm for linear programming to a general...
Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices
1992
The authors show that a modified variant of the interior point method can solve linear...
Limiting behavior of the affine scaling continuous trajectories for linear programming problems
1991
The authors consider the continuous trajectories of the vector field induced by the...
An extension of Karmarkar type algorithm to a class of convex separable programming problems with global linear rate of convergence
1990
The authors describe a primal-dual interior point algorithm for a class of convex...
An implementation of Karmarkar’s algorithm for linear programming
1989
This paper describes the implementation of power series dual affine scaling variants...
Interior path following primal-dual algorithms, part I: Linear programming
1989
The authors describe a primal-dual interior point algorithm for linear programming...
Interior path following primal-dual algorithms, part II: Convex quadratic programming
1989
The authors describe a primal-dual interior point algorithm for convex quadratic...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers