12 multiple-choice questions, progressively harder.
Maximize P=3x+5yP = 3x + 5yP=3x+5y subject to x+2y≤10x + 2y \le 10x+2y≤10, x+y≤7x + y \le 7x+y≤7, x≥0x \ge 0x≥0, y≥0y \ge 0y≥0.
Solution
Correct answer: A
The corners are (0,0)(0,0)(0,0), (7,0)(7,0)(7,0) (where x+y=7x + y = 7x+y=7 meets the xxx-axis), (0,5)(0,5)(0,5) (where x+2y=10x + 2y = 10x+2y=10 meets the yyy-axis), and the crossing of the two slanted lines.
(x+2y)−(x+y)=10−7 ⇒ y=3, x=4(x + 2y) - (x + y) = 10 - 7 \;\Rightarrow\; y = 3, \; x = 4(x+2y)−(x+y)=10−7⇒y=3,x=4
Evaluate PPP: P(0,0)=0P(0,0)=0P(0,0)=0, P(7,0)=21P(7,0)=21P(7,0)=21, P(4,3)=27P(4,3)=27P(4,3)=27, P(0,5)=25P(0,5)=25P(0,5)=25. The maximum is 272727, at (4,3)(4, 3)(4,3).
A shaded region is the part of the first quadrant strictly below the dashed line through (0,6)(0, 6)(0,6) and (3,0)(3, 0)(3,0), containing the origin. Which system describes it?
Correct answer: B
The line through (0,6)(0, 6)(0,6) and (3,0)(3, 0)(3,0) has slope 0−63−0=−2\frac{0 - 6}{3 - 0} = -23−00−6=−2, so it is y=−2x+6y = -2x + 6y=−2x+6, that is 2x+y=62x + y = 62x+y=6. Test the origin.
2(0)+0=0<6 is true2(0) + 0 = 0 < 6 \text{ is true}2(0)+0=0<6 is true
The origin satisfies 2x+y<62x + y < 62x+y<6, and because the boundary is dashed the inequality is strict. With the first quadrant this gives x≥0x \ge 0x≥0, y≥0y \ge 0y≥0, 2x+y<62x + y < 62x+y<6.
How many corners does the feasible region x≥0x \ge 0x≥0, y≥0y \ge 0y≥0, x≤6x \le 6x≤6, x+y≤8x + y \le 8x+y≤8, y≤5y \le 5y≤5 have?
Correct answer: D
Trace the boundary: (0,0)(0,0)(0,0), (6,0)(6,0)(6,0) along the xxx-axis, up x=6x = 6x=6 to where x+y=8x + y = 8x+y=8, then across to where y=5y = 5y=5, then down the yyy-axis.
(6,2) where x=6,(3,5) where y=5(6, 2) \text{ where } x = 6, \quad (3, 5) \text{ where } y = 5(6,2) where x=6,(3,5) where y=5
The corners are (0,0)(0,0)(0,0), (6,0)(6,0)(6,0), (6,2)(6,2)(6,2), (3,5)(3,5)(3,5), (0,5)(0,5)(0,5): a pentagon with 555 corners.
A feasible region has corners (0,0)(0, 0)(0,0), (5,0)(5, 0)(5,0), (3,4)(3, 4)(3,4), and (0,6)(0, 6)(0,6). What is the maximum value of P=2x+yP = 2x + yP=2x+y?
Evaluate PPP at every corner.
P(0,0)=0, P(5,0)=10, P(3,4)=10, P(0,6)=6P(0,0)=0, \; P(5,0)=10, \; P(3,4)=10, \; P(0,6)=6P(0,0)=0,P(5,0)=10,P(3,4)=10,P(0,6)=6
The maximum value is 101010. It happens to be reached at two corners, (5,0)(5, 0)(5,0) and (3,4)(3, 4)(3,4), which occurs when the objective line is parallel to the edge joining them; the value is still 101010.
What is the minimum of P=x+yP = x + yP=x+y over the region x≥2x \ge 2x≥2, y≥1y \ge 1y≥1?
The region is unbounded, but x+yx + yx+y is smallest when both variables are as small as allowed, at the corner (2,1)(2, 1)(2,1).
P(2,1)=2+1=3P(2, 1) = 2 + 1 = 3P(2,1)=2+1=3
The minimum is 333. The region has no upper bound, so PPP has no maximum, but the minimum exists at the corner.
What is the feasible region of x−y≥3x - y \ge 3x−y≥3 and y−x≥3y - x \ge 3y−x≥3?
Add the two inequalities. The left sides cancel to 000.
(x−y)+(y−x)≥3+3 ⇒ 0≥6 is false(x - y) + (y - x) \ge 3 + 3 \;\Rightarrow\; 0 \ge 6 \text{ is false}(x−y)+(y−x)≥3+3⇒0≥6 is false
Assuming a common solution leads to the false statement 0≥60 \ge 60≥6, so no point satisfies both and the region is empty.
A feasible region has corners (0,0)(0, 0)(0,0), (3,0)(3, 0)(3,0), (2,2)(2, 2)(2,2), and (0,3)(0, 3)(0,3). What is the maximum of P=7x+6yP = 7x + 6yP=7x+6y?
Evaluate PPP at each corner.
P(0,0)=0, P(3,0)=21, P(2,2)=26, P(0,3)=18P(0,0)=0, \; P(3,0)=21, \; P(2,2)=26, \; P(0,3)=18P(0,0)=0,P(3,0)=21,P(2,2)=26,P(0,3)=18
The maximum is 262626, at (2,2)(2, 2)(2,2).
The region defined by x≥0x \ge 0x≥0, y≥0y \ge 0y≥0, and x+y≥3x + y \ge 3x+y≥3 is which of these?
Correct answer: C
The region is the part of the first quadrant on or above the line x+y=3x + y = 3x+y=3.
x+y≥3 places no ceiling on x+yx + y \ge 3 \text{ places no ceiling on } x + yx+y≥3 places no ceiling on x+y
Points extend outward without limit, so the region is unbounded.
A feasible region has corners (1,1)(1, 1)(1,1), (2,5)(2, 5)(2,5), and (4,2)(4, 2)(4,2). What is the maximum of P=x+yP = x + yP=x+y?
Evaluate P=x+yP = x + yP=x+y at each corner.
P(1,1)=2,P(2,5)=7,P(4,2)=6P(1,1)=2, \quad P(2,5)=7, \quad P(4,2)=6P(1,1)=2,P(2,5)=7,P(4,2)=6
The maximum is 777, at (2,5)(2, 5)(2,5).
At which point do the boundaries y=2xy = 2xy=2x and x+y=6x + y = 6x+y=6 cross?
Substitute y=2xy = 2xy=2x into the second equation.
x+2x=6 ⇒ 3x=6 ⇒ x=2x + 2x = 6 \;\Rightarrow\; 3x = 6 \;\Rightarrow\; x = 2x+2x=6⇒3x=6⇒x=2
Then y=2x=4y = 2x = 4y=2x=4, so the corner is (2,4)(2, 4)(2,4).
Minimize C=3x+2yC = 3x + 2yC=3x+2y subject to x+y≥8x + y \ge 8x+y≥8, x≥0x \ge 0x≥0, y≥0y \ge 0y≥0.
The region is unbounded, so check the corners of its lower boundary x+y=8x + y = 8x+y=8, namely (8,0)(8, 0)(8,0) and (0,8)(0, 8)(0,8).
C(8,0)=24,C(0,8)=16C(8, 0) = 24, \quad C(0, 8) = 16C(8,0)=24,C(0,8)=16
The minimum is 161616, at (0,8)(0, 8)(0,8). Because yyy is cheaper per unit than xxx in the objective, pushing everything onto yyy is best.
How many corners does the feasible region x≥0x \ge 0x≥0, y≥0y \ge 0y≥0, x≤4x \le 4x≤4, y≤4y \le 4y≤4, x+y≤6x + y \le 6x+y≤6 have?
Trace the boundary: (0,0)(0,0)(0,0), (4,0)(4,0)(4,0) along the xxx-axis, up x=4x = 4x=4 to where x+y=6x + y = 6x+y=6, then across to where y=4y = 4y=4, then down the yyy-axis.
(4,2) where x=4,(2,4) where y=4(4, 2) \text{ where } x = 4, \quad (2, 4) \text{ where } y = 4(4,2) where x=4,(2,4) where y=4
The corners are (0,0)(0,0)(0,0), (4,0)(4,0)(4,0), (4,2)(4,2)(4,2), (2,4)(2,4)(2,4), (0,4)(0,4)(0,4): a pentagon with 555 corners.
Reset this practice set?
This clears every answer you have given and starts the set again from question 1.