How to determine simplex time complexity (ie Max flow)

Question

Simplex algorithm is said to have exponential worst case time complexity. Yet it is still often used in practice. How can you determine the average time complexity for a certain

Answer 1

If it is still interesting. Time complexity of simplex is O((n+m)*n).

n - number of variables.

m - inequality constraints.

Why? Because the number of iterations could be no more than n + m in case of n which is an upper bound on the numbers of vertices .

But this upper bound is exponential in n.