caption: Linear programming (cont.)  The number of corner points is finite  The global maximum is at the corner point in which Z(x) is greater or equal to the value of Z at all adjacent corner points  The simplex method (Dantzig 1948) starts at a feasible corner point and visited a sequence of corner points until a maximum is obtained  #of iterations is almost always O(M) or O(N) whichever is larger, but can become exponential for pathological cases
exif: {}