Search Results - subject:"average-case complexity of algorithms"

A lower bound on the average number of Pivot-steps for solving linear programs Valid for all variants of the Simplex-Algorithm

Borgwardt, Karl Heinz; Huhn, Petra - In: Mathematical Methods of Operations Research 49 (1999) 2, pp. 175-210

In this paper we derive a lower bound on the average complexity of the Simplex-Method as a solution-process for linear programs (LP) of the type:<Equation ID="Equ1"> <EquationSource Format="TEX"/> </Equation> We assume these problems to be randomly generated according to the Rotation-Symmetry-Model: *Let a <Subscript>1</Subscript>,…,a <Subscript>m</Subscript>, v be distributed independently,...</subscript></subscript></equation>

Persistent link: https://www.econbiz.de/10010999590

A lower bound on the average number of Pivot-steps for solving linear programs Valid for all variants of the Simplex-Algorithm

Borgwardt, Karl Heinz; Huhn, Petra - In: Computational Statistics 49 (1999) 2, pp. 175-210

In this paper we derive a lower bound on the average complexity of the Simplex-Method as a solution-process for linear programs (LP) of the type: We assume these problems to be randomly generated according to the Rotation-Symmetry-Model: *Let a 1 ,…,a m , v be distributed independently,...

Persistent link: https://www.econbiz.de/10010759188