36 search results - page 1 / 8 » A Shadow Simplex Method for Infinite Linear Programs |
IOR
2010
13 years 2 months ago
2010
We present a Simplex-type algorithm, that is, an algorithm that moves from one extreme point of the infinite-dimensional feasible region to another not necessarily adjacent extrem...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
We present the first randomized polynomial-time simplex algorithm for linear programming. Like the other known polynomial-time algorithms for linear programming, its running time ...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
Abstract. The simplex method in Linear Programming motivates several problems of asymptotic convex geometry. We discuss some conjectures and known results in two related directions...
ATMOS
2008
13 years 6 months ago
2008
In the last 15 years periodic timetable problems have found much interest in the combinatorial optimization community. We will focus on the optimisation task to minimise a weighted...
ICPR
2008
IEEE
13 years 11 months ago
2008
IEEE
Active set methods for training the Support Vector Machines (SVM) are advantageous since they enable incremental training and, as we show in this research, do not exhibit exponent...