12 multiple-choice questions, progressively harder.
Minimize C=3x+4yC = 3x + 4yC=3x+4y subject to x+y≥4x + y \ge 4x+y≥4, x≥0x \ge 0x≥0, y≥0y \ge 0y≥0.
Solution
Correct answer: A
The region is unbounded, but its lower boundary x+y=4x + y = 4x+y=4 has the two corners (4,0)(4, 0)(4,0) and (0,4)(0, 4)(0,4), and the minimum of a linear objective sits at a corner.
C(4,0)=12,C(0,4)=16C(4, 0) = 12, \quad C(0, 4) = 16C(4,0)=12,C(0,4)=16
The minimum is 121212, at (4,0)(4, 0)(4,0). There is no maximum, since the region runs outward forever, but the minimum still exists at a vertex.
A bakery makes xxx cakes and yyy pies. Oven time gives 2x+y≤142x + y \le 142x+y≤14, prep time gives x+y≤9x + y \le 9x+y≤9, with x≥0x \ge 0x≥0, y≥0y \ge 0y≥0. Profit is P=5x+4yP = 5x + 4yP=5x+4y dollars. What is the greatest profit?
Correct answer: C
The corners are (0,0)(0,0)(0,0), (7,0)(7,0)(7,0) (where 2x+y=142x + y = 142x+y=14 meets the xxx-axis), (0,9)(0,9)(0,9), and the crossing of 2x+y=142x + y = 142x+y=14 with x+y=9x + y = 9x+y=9.
(2x+y)−(x+y)=14−9 ⇒ x=5, y=4(2x + y) - (x + y) = 14 - 9 \;\Rightarrow\; x = 5, \; y = 4(2x+y)−(x+y)=14−9⇒x=5,y=4
Evaluate PPP: P(0,0)=0P(0,0)=0P(0,0)=0, P(7,0)=35P(7,0)=35P(7,0)=35, P(5,4)=41P(5,4)=41P(5,4)=41, P(0,9)=36P(0,9)=36P(0,9)=36. The greatest profit is 414141 dollars, at (5,4)(5, 4)(5,4).
Does P=x+yP = x + yP=x+y have a maximum over the region x≥0x \ge 0x≥0, y≥0y \ge 0y≥0?
The first quadrant extends forever, so x+yx + yx+y can be made as large as you like.
Taking (x,y)=(n,n) gives P=2n→∞\text{Taking } (x, y) = (n, n) \text{ gives } P = 2n \to \inftyTaking (x,y)=(n,n) gives P=2n→∞
No finite value is the largest, so PPP has no maximum. (It does have a minimum of 000 at the origin, but that is a different question.)
Which system has an empty feasible region?
A region is empty when the constraints contradict each other. Compare the sum x+yx + yx+y in each choice.
x+y≤1andx+y≥5 cannot both holdx + y \le 1 \quad\text{and}\quad x + y \ge 5 \text{ cannot both hold}x+y≤1andx+y≥5 cannot both hold
No value is both ≤1\le 1≤1 and ≥5\ge 5≥5, so the system with x+y≤1x + y \le 1x+y≤1 and x+y≥5x + y \ge 5x+y≥5 is empty. Each other system has points that satisfy both of its inequalities.
A rectangular feasible region has corners (0,0)(0, 0)(0,0), (4,0)(4, 0)(4,0), (4,3)(4, 3)(4,3), (0,3)(0, 3)(0,3). What is the maximum of P=x+2yP = x + 2yP=x+2y?
Correct answer: D
Evaluate PPP at all four corners.
P(0,0)=0, P(4,0)=4, P(4,3)=10, P(0,3)=6P(0,0)=0, \; P(4,0)=4, \; P(4,3)=10, \; P(0,3)=6P(0,0)=0,P(4,0)=4,P(4,3)=10,P(0,3)=6
The maximum is 101010, at (4,3)(4, 3)(4,3).
At which point do the boundaries 4x+y=94x + y = 94x+y=9 and x+y=3x + y = 3x+y=3 cross?
Correct answer: B
Subtract the second equation from the first to eliminate yyy.
(4x+y)−(x+y)=9−3 ⇒ 3x=6(4x + y) - (x + y) = 9 - 3 \;\Rightarrow\; 3x = 6(4x+y)−(x+y)=9−3⇒3x=6
So x=2x = 2x=2, and then y=3−x=1y = 3 - x = 1y=3−x=1. The corner is (2,1)(2, 1)(2,1).
Minimize C=2x+3yC = 2x + 3yC=2x+3y subject to x+y≥4x + y \ge 4x+y≥4, x+3y≥6x + 3y \ge 6x+3y≥6, x≥0x \ge 0x≥0, y≥0y \ge 0y≥0.
The region is unbounded above, so check the corners of its lower boundary: (6,0)(6, 0)(6,0), (0,4)(0, 4)(0,4), and the crossing of x+y=4x + y = 4x+y=4 with x+3y=6x + 3y = 6x+3y=6.
(x+3y)−(x+y)=6−4 ⇒ 2y=2 ⇒ (3,1)(x + 3y) - (x + y) = 6 - 4 \;\Rightarrow\; 2y = 2 \;\Rightarrow\; (3, 1)(x+3y)−(x+y)=6−4⇒2y=2⇒(3,1)
Evaluate CCC: C(6,0)=12C(6,0)=12C(6,0)=12, C(3,1)=9C(3,1)=9C(3,1)=9, C(0,4)=12C(0,4)=12C(0,4)=12. The minimum is 999, at (3,1)(3, 1)(3,1).
Minimize C=4x+5yC = 4x + 5yC=4x+5y subject to 2x+y≥82x + y \ge 82x+y≥8, x+y≥5x + y \ge 5x+y≥5, x≥0x \ge 0x≥0, y≥0y \ge 0y≥0.
The region is unbounded above, so check the corners of its lower boundary: (0,8)(0, 8)(0,8), (5,0)(5, 0)(5,0), and the crossing of 2x+y=82x + y = 82x+y=8 with x+y=5x + y = 5x+y=5.
(2x+y)−(x+y)=8−5 ⇒ x=3, y=2(2x + y) - (x + y) = 8 - 5 \;\Rightarrow\; x = 3, \; y = 2(2x+y)−(x+y)=8−5⇒x=3,y=2
Evaluate CCC: C(0,8)=40C(0,8)=40C(0,8)=40, C(3,2)=22C(3,2)=22C(3,2)=22, C(5,0)=20C(5,0)=20C(5,0)=20. The minimum is 202020, at (5,0)(5, 0)(5,0).
Is (2,2)(2, 2)(2,2) in the feasible region of x+2y≤6x + 2y \le 6x+2y≤6, 2x+y≤62x + y \le 62x+y≤6, x≥0x \ge 0x≥0, y≥0y \ge 0y≥0?
Check every inequality at (2,2)(2, 2)(2,2).
x+2y=6≤6,2x+y=6≤6,2≥0,2≥0x + 2y = 6 \le 6, \quad 2x + y = 6 \le 6, \quad 2 \ge 0, \quad 2 \ge 0x+2y=6≤6,2x+y=6≤6,2≥0,2≥0
All four hold (the first two with equality, so (2,2)(2, 2)(2,2) is actually the corner where those boundaries cross). The point is in the region.
Which inequality describes the region on or to the left of the solid vertical line x=4x = 4x=4?
Points to the left of the line have a smaller xxx-coordinate, and the solid line includes its own points.
x≤4x \le 4x≤4
The symbol ≤\le≤ allows equality, matching the solid boundary; a dashed line would give x<4x < 4x<4.
A shaded triangle has vertices (0,0)(0, 0)(0,0), (6,0)(6, 0)(6,0), and (0,4)(0, 4)(0,4) with solid edges. Which system describes it?
Two edges lie on the axes (x≥0x \ge 0x≥0, y≥0y \ge 0y≥0). The third runs from (6,0)(6, 0)(6,0) to (0,4)(0, 4)(0,4): its equation is 2x+3y=122x + 3y = 122x+3y=12, since both points satisfy it. Test the interior point (1,1)(1, 1)(1,1).
2(1)+3(1)=5≤12 is true2(1) + 3(1) = 5 \le 12 \text{ is true}2(1)+3(1)=5≤12 is true
The interior satisfies 2x+3y≤122x + 3y \le 122x+3y≤12, so the system is x≥0x \ge 0x≥0, y≥0y \ge 0y≥0, 2x+3y≤122x + 3y \le 122x+3y≤12.
Is (1,3)(1, 3)(1,3) in the feasible region of x+y≤5x + y \le 5x+y≤5, y≤2x+1y \le 2x + 1y≤2x+1, x≥0x \ge 0x≥0?
Check each inequality at (1,3)(1, 3)(1,3).
1+3=4≤5,3≤2(1)+1=3,1≥01 + 3 = 4 \le 5, \quad 3 \le 2(1) + 1 = 3, \quad 1 \ge 01+3=4≤5,3≤2(1)+1=3,1≥0
All three hold (the second with equality, so the point sits on that boundary). The point is in the region.
Reset this practice set?
This clears every answer you have given and starts the set again from question 1.