The Simplex algorithm Quiz

1. The initial objective row for maximising $P=4x+7y$ has entries for $x$ and $y$ of

• A. $4$ and $7$
• B. $-4$ and $-7$
• C. $4$ and $-7$
• D. $-7$ and $-4$

2. How is the pivot column chosen?

• A. The column with the largest value
• B. The column of the first slack variable
• C. The column with the smallest positive entry in the objective row
• D. The column with the most negative entry in the objective row

3. A pivot column has entries $4$, $-2$ and $2$ in rows with values $12$, $6$ and $5$. Which row is the pivot row?

• A. Row 1
• B. Row 2
• C. Row 3
• D. None of them

4. When has the Simplex algorithm finished for a maximising problem?

• A. When there are no negative entries in the objective row
• B. When all values are positive
• C. When a slack variable is zero
• D. After exactly two iterations

5. To minimise $C=x-2y$, which should be maximised?

• A. $P=x-2y$
• B. $P=-x+2y$
• C. $P=x+2y$
• D. $P=2y-x+1$