The simplex algorithm 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
- What does a slack variable represent?
- The unused amount of a resource in a constraint.
- How is written with a slack variable?
- with .
- How is the objective written in the tableau?
- .
- How is the pivot column chosen?
- The most negative entry in the objective row.
- How is the pivot row chosen?
- Divide each right-hand side by the positive pivot-column entry in its row and take the smallest ratio.
- What do you do with the pivot row?
- Divide it by the pivot entry, then use it to make every other entry in the pivot column zero.
- When is a simplex solution optimal?
- When there are no negative coefficients in the objective row.
- What are basic variables?
- Variables that can be non-zero; they appear in one row with coefficient 1.
- What is the value of a non-basic variable?
- Zero.
- What does a slack of zero mean?
- The constraint is binding: that resource is fully used.
- What does a positive slack mean?
- That amount of the resource is unused.
- How do you minimise using the simplex algorithm?
- Maximise , then the minimum value of is .
- What do you do after each iteration?
- Check the objective row for negative entries; if any remain, do another iteration.