Two New Bounds for the Random-Edge Simplex-Algorithm.

Bernd Gärtner Volker Kaibel

Published in: SIAM J. Discret. Math. (2007)

Keyphrases

simplex algorithm
randomly generated
nelder mead
linear programming
network simplex algorithm
primal dual
lower bound
linear programming problems
upper bound
feasible solution
np complete
simplex method
linear program
boolean functions
branch and bound algorithm
phase transition
convex optimization