2,415 research outputs found
The Complexity of the Simplex Method
The simplex method is a well-studied and widely-used pivoting method for
solving linear programs. When Dantzig originally formulated the simplex method,
he gave a natural pivot rule that pivots into the basis a variable with the
most violated reduced cost. In their seminal work, Klee and Minty showed that
this pivot rule takes exponential time in the worst case. We prove two main
results on the simplex method. Firstly, we show that it is PSPACE-complete to
find the solution that is computed by the simplex method using Dantzig's pivot
rule. Secondly, we prove that deciding whether Dantzig's rule ever chooses a
specific variable to enter the basis is PSPACE-complete. We use the known
connection between Markov decision processes (MDPs) and linear programming, and
an equivalence between Dantzig's pivot rule and a natural variant of policy
iteration for average-reward MDPs. We construct MDPs and show
PSPACE-completeness results for single-switch policy iteration, which in turn
imply our main results for the simplex method
Erfahrungen bei der Therapie der Enzootischen Bronchopneumonie von Mastrindern mit einem neuen Makrolidantibiotikum - Eine Feldstudie
Wirkungsvergleich von Kortikosteroiden (Dexamethason, Flumethason, Triamcinolon) bei der Azetonämie des Rindes
"Euter-Schenkel-Dermatitis" des Rindes: Epidemiologische, klinische und bakteriologische Untersuchungen
Удалённое управление прибором измерения параметров электрохимической защиты нефтегазотрубопроводов с применением мобильных устройств
The following article presents the implementation of the control measuring device using a mobile device via Bluetooth. It explains the structure of this software. This article can be of interest for software engineers who develop mobile applications for control devices via Bluetooth
Intravenöse Infusion flüchtiger Fettsäuren als Stoffwechselbelastungstest zur Überprüfung möglicher Butafosfanwirkungen auf den Energiestoffwechsel des Rindes
- …