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
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?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
