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 the Simplex algorithm do?
- Moves from vertex to vertex of the feasible region, improving the objective each time, until no improvement is possible.
- How is the objective written in the initial tableau?
- for .
- Which variables are basic at the start?
- The slack variables.
- How do you choose the pivot column?
- The most negative entry in the objective row.
- How do you choose the pivot row?
- The smallest ratio value ÷ entry, using only positive entries in the pivot column.
- Why ignore negative entries in the ratio test?
- They would make the next solution infeasible.
- What is the first row operation after choosing the pivot?
- Divide the pivot row by the pivot element.
- What are the other row operations?
- Subtract multiples of the new pivot row to make the pivot column 0 in every other row, including P.
- When is a tableau optimal?
- When there are no negative entries in the objective row.
- How do you read the solution from an optimal tableau?
- Basic variables take the value in their row; non-basic variables are 0.
- How do you handle a minimising problem?
- Maximise , then minimum .
- What does a basic slack variable of 0 mean?
- The constraint is binding at that vertex.
- How can you check an optimal solution?
- Substitute into the original constraints and objective.