The simplex algorithm

The simplex algorithm Quiz

Spec DD3–DD4 · AQA A-Level Further Maths: Quiz

Studying this course? Keep your progress in one place.

Pick an answer for each. Quizzes never use energy.

5 questions, one answer each

Each answer is checked as you go, with why.

See all 5 questions

1. In the equation $x+2y+s=10$ , what does the slack variable $s$ represent?
- A. The profit
- B. The amount of $x$ made
- C. The unused part of the constraint
- D. The amount of $y$ made
2. The objective row is $P-4x-7y=0$ in the initial tableau. Which column is the pivot column?
- A. The $x$ column
- B. The right-hand side column
- C. The $P$ column
- D. The $y$ column
3. The pivot column entries are 2, 5 and 0 with right-hand sides 10, 20 and 8. Which row is the pivot row?
- A. The first row
- B. The second row
- C. The third row
- D. Any row
4. When can the simplex algorithm stop for a maximising problem?
- A. When the objective row has no negative coefficients
- B. When $P$ is a whole number
- C. When all slack variables are zero
- D. After two iterations
5. How would you minimise $Q=3x-2y$ using the simplex algorithm?
- A. Maximise $P=3x-2y$
- B. Use the largest ratio
- C. Maximise $P=-3x+2y$ and give $Q=-P$
- D. Divide $Q$ by 3