Two-stage Simplex and big-M methods

Two-stage Simplex and big-M methods Flashcards

Spec 5.4 · Edexcel A-Level Further Maths: Flashcards

Studying this course? Keep your progress in one place.

Flip each card. Be honest: the ones you mark Not yet come back first.

13 cards

Tap a card to flip it. Swipe right if you knew it, left if not.

See all 13 cards
Why does a ≥\ge constraint need an artificial variable?
The origin gives a negative surplus, so there is no starting basic feasible solution; tt supplies one.
Write x+2y≥6x+2y\ge6 with surplus s2s_2 and artificial tt.
x+2y−s2+t=6x+2y-s_2+t=6
What must an artificial variable equal in a genuine solution?
Zero.
What is MM in the big-M method?
A very large positive constant.
How is the objective written in the big-M method (maximising)?
P=3x+4y−MtP=3x+4y-Mt, i.e. P−3x−4y+Mt=0P-3x-4y+Mt=0.
Why subtract M×tM\times t row from the PP row?
So that the basic variable tt has zero in the objective row (a unit column).
What does t>0t>0 in the optimal big-M tableau show?
No feasible solution.
What is the stage 1 objective in the two-stage method?
Minimise I=I= the sum of the artificial variables.
What does a stage 1 minimum of 0 mean?
A basic feasible solution exists; go to stage 2.
What does a positive stage 1 minimum mean?
The problem has no feasible solution.
What happens in stage 2?
Delete the QQ row and artificial column, then continue with the original PP row.
How do you handle minimising CC?
Maximise P=−CP=-C with the same method; then C=−PC=-P.
Which method uses symbolic MM and which uses only numbers?
Big-M uses MM; two-stage uses only numbers.

Flashcards