run time of Simplex for LPs (avg. case) is polynomial: linear # of iterations wrt constraints; each iteration approx. a quadratic # number of evaluations.
run time of Simplex for LPs (avg. case) is polynomial: linear # of iterations wrt constraints; each iteration approx. a quadratic #number of evaluations.