Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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.

share|cite|improve this question
what is the pivot rule? – tulasi Jun 14 '12 at 16:00
with danzig rule thanks! – Yannis Assael Jun 15 '12 at 14:38
up vote 2 down vote accepted

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.

share|cite|improve this answer
so the solution here is unnecessarily complicated? the only difference between what you wrote and what i would submit to my professor is symbols. i honestly don't think the proof gets more complicated than that. oh wait, do you think myb we might need to prove – BCLC Mar 7 at 20:38
that the variable's $z_j - c_j$ becomes nonnegative in the next iteration? – BCLC Mar 7 at 20:38

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.