Two-stage Simplex and big-M methods 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 constraint need an artificial variable?
- The origin gives a negative surplus, so there is no starting basic feasible solution; supplies one.
- Write with surplus and artificial .
- What must an artificial variable equal in a genuine solution?
- Zero.
- What is in the big-M method?
- A very large positive constant.
- How is the objective written in the big-M method (maximising)?
- , i.e. .
- Why subtract row from the row?
- So that the basic variable has zero in the objective row (a unit column).
- What does in the optimal big-M tableau show?
- No feasible solution.
- What is the stage 1 objective in the two-stage method?
- Minimise 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 row and artificial column, then continue with the original row.
- How do you handle minimising ?
- Maximise with the same method; then .
- Which method uses symbolic and which uses only numbers?
- Big-M uses ; two-stage uses only numbers.