Two-stage Simplex and big-M methods

Two-stage Simplex and big-M methods Quiz

Spec 5.4 · Edexcel 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. Which constraint needs an artificial variable?
- A. $x+y\le5$
- B. $2x+y\ge3$
- C. $x\ge0$
- D. $y\le4$
2. In the big-M method, $M$ is
- A. a small positive number
- B. the maximum profit
- C. a very large positive constant
- D. an extra decision variable
3. What is the stage 1 objective in the two-stage method?
- A. Minimise the sum of the artificial variables
- B. Maximise profit
- C. Minimise the slack variables
- D. Maximise the surplus variables
4. Stage 1 of the two-stage method ends with minimum $I=0$ . What does this mean?
- A. The problem is unbounded
- B. The problem is infeasible
- C. The optimal solution has been found
- D. A basic feasible solution to the original problem has been found
5. For $P=3x+2y$ and one artificial variable $t$ , the big-M objective row is
- A. $P-3x-2y-Mt=0$
- B. $P-3x-2y+Mt=0$
- C. $P+3x+2y+Mt=0$
- D. $P-3x-2y=Mt$