Question: Suppose the simplex method has explored a certain Basic Feasible Solution (BFS), and deemed it is NOT optimal. Then, the simplex method will NEVER revisit
Suppose the simplex method has explored a certain Basic Feasible Solution (BFS), and deemed it is NOT optimal. Then, the simplex method will NEVER revisit that BFS or ANY other BFS with higher objective function value. (Assume you are solving an LP in standard form.)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
