14 Consider an LP with five basic feasible solutions and a unique optimal solution. Assume that the...
Question:
14 Consider an LP with five basic feasible solutions and a unique optimal solution. Assume that the simplex method begins at the worst basic feasible solution, and on each pivot the simplex is equally likely to move to any better basic feasible solution.
On the average, how many pivots will be required to find the optimal solution to the LP?
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Operations Research Applications And Algorithms
ISBN: 9780534380588
4th Edition
Authors: Wayne L. Winston
Question Posted: