How can I prove that in the simplex method, a variable that has just left the basis cannot re-enter the basis on the very next iteration? The pivoting rule is Dantzig's.
- Anybody can ask a question
- Anybody can answer
- The best answers are voted up and rise to the top
Assume the problem to be a minimization problem. Then we choose an entering variable only if the coefficient in the objective row of that variable is negative so as to reduce the objective value by increasing the value of the variable (from it's current value).
When a variable leaves the basis, the coefficient in the objective row of that variable becomes non-negative. In the next iteration of simplex, only variables with a negative coefficient can enter the basis. Hence the variable that just left cannot re-enter the basis in the very next iteration.