12 multiple-choice questions, progressively harder.
Which inequality is graphed below?
Solution
Correct answer: C
The boundary passes through (0,1)(0, 1)(0,1) and (2,2)(2, 2)(2,2), a slope of 12\tfrac{1}{2}21, so it is y=12x+1y = \tfrac{1}{2}x + 1y=21x+1. It is dashed (strict) and the region below it, containing the origin, is shaded.
test (0,0): 0<12(0)+1 ⇒ 0<1 (true)\text{test } (0, 0):\ 0 < \tfrac{1}{2}(0) + 1 \;\Rightarrow\; 0 < 1 \ \text{(true)}test (0,0): 0<21(0)+1⇒0<1 (true)
The dashed line with the lower side gives y<12x+1y < \tfrac{1}{2}x + 1y<21x+1.
Which point is in the feasible region of y>−2y > -2y>−2 and y<2xy < 2xy<2x?
Correct answer: D
Test each point against both inequalities.
(3,1): 1>−2 and 1<2(3)=6 (both true)(3, 1):\ 1 > -2 \ \text{and}\ 1 < 2(3) = 6 \ \text{(both true)}(3,1): 1>−2 and 1<2(3)=6 (both true)
The point (0,0)(0, 0)(0,0) fails y<2xy < 2xy<2x since 0<00 < 00<0 is false, (1,3)(1, 3)(1,3) fails y<2xy < 2xy<2x since 3<23 < 23<2 is false, and (−2,−3)(-2, -3)(−2,−3) fails y>−2y > -2y>−2. Only (3,1)(3, 1)(3,1) works.
The boundaries x=2x = 2x=2 and y=x+1y = x + 1y=x+1 of a system meet at:
Correct answer: B
Substitute x=2x = 2x=2 into y=x+1y = x + 1y=x+1.
y=2+1=3y = 2 + 1 = 3y=2+1=3
So the boundaries intersect at (2,3)(2, 3)(2,3).
A solid line through (0,3)(0, 3)(0,3) and (3,0)(3, 0)(3,0) has the region containing the origin shaded. The inequality is:
Correct answer: A
The line through (0,3)(0, 3)(0,3) and (3,0)(3, 0)(3,0) is x+y=3x + y = 3x+y=3. It is solid (inclusive), and the origin is shaded.
test (0,0): 0+0=0≤3 (true)\text{test } (0, 0):\ 0 + 0 = 0 \le 3 \ \text{(true)}test (0,0): 0+0=0≤3 (true)
Solid and the origin side give x+y≤3x + y \le 3x+y≤3.
Is (4,−1)(4, -1)(4,−1) a solution of 2x+5y<32x + 5y < 32x+5y<3?
Substitute into the left side 2x+5y2x + 5y2x+5y.
2(4)+5(−1)=8−5=3,so the statement is 3<32(4) + 5(-1) = 8 - 5 = 3, \quad \text{so the statement is}\ 3 < 32(4)+5(−1)=8−5=3,so the statement is 3<3
That is false. The point is on the boundary, and the strict <<< excludes it.
The system x>−2x > -2x>−2 and x<3x < 3x<3 describes:
Both conditions constrain xxx only, trapping it between two vertical lines.
−2<x<3-2 < x < 3−2<x<3
The overlap is the vertical strip between x=−2x = -2x=−2 and x=3x = 3x=3.
Which point satisfies all of y≥0y \ge 0y≥0, x≥0x \ge 0x≥0, and x+2y≤4x + 2y \le 4x+2y≤4?
Test each point against the three inequalities.
(2,1): 1≥0, 2≥0, 2+2(1)=4≤4 (all true)(2, 1):\ 1 \ge 0,\ 2 \ge 0,\ 2 + 2(1) = 4 \le 4 \ \text{(all true)}(2,1): 1≥0, 2≥0, 2+2(1)=4≤4 (all true)
The point (0,3)(0, 3)(0,3) gives 0+6=6≤40 + 6 = 6 \le 40+6=6≤4 (false), (4,1)(4, 1)(4,1) gives 4+2=6≤44 + 2 = 6 \le 44+2=6≤4 (false), and (−1,1)(-1, 1)(−1,1) fails x≥0x \ge 0x≥0. Only (2,1)(2, 1)(2,1) works.
Which system's feasible region is the set of points on or above y=1y = 1y=1 and on or below y=4y = 4y=4?
On or above y=1y = 1y=1 is y≥1y \ge 1y≥1, and on or below y=4y = 4y=4 is y≤4y \le 4y≤4; both are inclusive.
1≤y≤41 \le y \le 41≤y≤4
The system y≥1y \ge 1y≥1 and y≤4y \le 4y≤4 gives that horizontal band.
After drawing the boundary for y≤3x−2y \le 3x - 2y≤3x−2, you test (0,0)(0, 0)(0,0) and get 0≤−20 \le -20≤−2, false. The origin is:
The test result decides membership.
0≤3(0)−2 ⇒ 0≤−2 (false)0 \le 3(0) - 2 \;\Rightarrow\; 0 \le -2 \ \text{(false)}0≤3(0)−2⇒0≤−2 (false)
Since the origin is not a solution, shade the side that does not contain it.
For a system of three inequalities, a point is in the feasible region only if it:
The feasible region is the overlap of all three half-planes, so membership requires every inequality to hold.
feasible ⇔ all three inequalities true\text{feasible} \;\Leftrightarrow\; \text{all three inequalities true}feasible⇔all three inequalities true
Missing even one condition puts the point outside the region.
To graph 6x+y≤66x + y \le 66x+y≤6, you draw:
The boundary comes from the matching equation, and ≤\le≤ is inclusive, so the line is solid.
6x+y≤6 ⇒ solid line 6x+y=66x + y \le 6 \;\Rightarrow\; \text{solid line } 6x + y = 66x+y≤6⇒solid line 6x+y=6
Replace the symbol with === and draw it solid.
The system y≥2y \ge 2y≥2 and y≥5y \ge 5y≥5 simplifies to which single condition?
A point must satisfy both, so it must clear the stricter lower bound.
y≥2 and y≥5 ⇒ y≥5y \ge 2 \ \text{and}\ y \ge 5 \;\Rightarrow\; y \ge 5y≥2 and y≥5⇒y≥5
Every y≥5y \ge 5y≥5 automatically satisfies y≥2y \ge 2y≥2, so y≥5y \ge 5y≥5 is the overlap.
Reset this practice set?
This clears every answer you have given and starts the set again from question 1.