6. Decision Mathematics

Linear Programming — Quiz

Test your understanding of linear programming with 5 practice questions.

Practice Questions

Question 1

What does a slack variable $s$ represent when added to a constraint $ax+by\le c$?

Question 2

When converting a constraint $ax+by\ge c$ into an equality for the simplex method, which variable is introduced and how?

Question 3

What does the reduced cost of a non-basic variable represent in linear programming?

Question 4

In the LP maximize $P=3x+5y$ subject to $2x+y\le8$, $x+2y\le7$, $x,y\ge0$, which corner-point yields the maximum $P$?

Question 5

Which set of constraints yields an unbounded feasible region where the objective $Z=x+y$ can increase without bound?