FURTHER EXPLORATION OF THE KLEE-MINTY PROBLEM
نویسندگان
چکیده
منابع مشابه
Randomized Simplex Algorithms on Klee-Minty Cubes
We investigate the behavior of randomized simplex algorithms on special linear programs. For this, we develop combinatorial models for the Klee-Minty cubes [17] and similar linear programs with exponential decreasing paths. The analysis of two most natural randomized pivot rules on the Klee-Minty cubes leads t o (nearly) quadratic lower bounds for the complexity of linear programming with rando...
متن کاملVolumetric Path and Klee-Minty Constructions
By introducing redundant Klee-Minty examples, we have previously shown that the central path can be bent along the simplex path. In this paper, we seek for an analogous result for the volumetric path defined by the volumetric barrier function. Although we only have a complete proof in 2D, the evidence provided by some illustrations anticipates that a KleeMinty construction exists for the volume...
متن کاملA Simplex-Genetic method for solving the Klee-Minty cube
Although the Simplex Method (SM) developed for Dantzig is efficient for solving many linear programming problems (LPs), there are constructions of hard linear programs as the Klee-Minty cubes and another deformed products, where this method has an exponential behavior. This work presents the integration of genetic algorithms (GA) and SM to fastly reach the optimum of this type of problems. This...
متن کاملThe Klee-Minty random edge chain moves with bounded speed
An infinite sequence of 0’s and 1’s evolves by flipping each 1 to a 0 exponentially at rate one. When a 1 flips, all bits to its right also flip. Starting from any configuration with finitely many 1’s to the left of the origin, we show that the leftmost 1 moves right with bounded speed. Upper and lower bounds are given on the speed. A consequence is that a lower bound for the run time of the ra...
متن کاملThe Klee-Minty random edge chain moves with linear speed
An infinite sequence of 0’s and 1’s evolves by flipping each 1 to a 0 exponentially at rate one. When a 1 flips, all bits to its right also flip. Starting from any configuration with finitely many 1’s to the left of the origin, we show that the leftmost 1 moves right with linear speed. Upper and lower bounds are given on the speed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics and Its Applications
سال: 2010
ISSN: 1412-677X
DOI: 10.29244/jmap.9.2.41-53