ML-Math-102-Systems-of-Inequalities-and-Linear-Programming
ML-Math-102-Systems-of-Inequalities-and-Linear-Programming
𝑦 < 2𝑥 + 3
Example: Graph the following inequality
-4
-6
-8
-10
𝑦 < 2𝑥 + 3
for this example.
2 < 2(−1) + 3
2<1
This point does not satisfy the inequality. Therefore, no point in the half-plane to the
left of the line does not satisfy the inequality.
Step 3: Now test the other half-plane. For this example, let’s use the point (𝟎, 𝟎).
𝑦 < 2𝑥 +
3 0 < 2(0)
+3
0<3
This point does satisfy the inequality. Therefore, every point in the half-plane to the
right of the line satisfies the inequality.
0
-10 -8 -6 -4 -2 0 2 4 6 8 10
-2
-4
-6
-8
-10
𝑥 and 𝑦-value that satisfies both inequalities, similar to how we wanted every possible 𝑥
To graph a system of linear inequalities in two variables, we want to find every possible
and 𝑦-value that satisfies both equations when we were solving systems of equations.
How to Solve a System of Linear Inequalities in Two Variables:
o 1. Using the technique of graphing inequalities above, graph both of the
inequalities given.
o 2. Draw the completed graph shading only the overlapped shaded regions from
the first step.
𝑦 < 3𝑥 + 2
Example: Graph the following system of inequalities.
1
𝑦≥−𝑥+1
2
Step 1: Change the inequality signs to equal signs and plot the lines accordingly.
1
𝑦 < 3𝑥 + 2 𝑦≥ 𝑥+1
2
−
1
𝑥+1
2
𝑦 = 3𝑥 + 2 𝑦=
−
Dotted Line Solid Line
Testing Points:
𝑦 < 3𝑥 + 2
Test points (−1,2) and (0,0)
2 < 3(−1) + 2 0 < 3(0) + 2
2<1 0<2
Does Not Satisfy Satisfies
(left of line) (right of line)
1
𝑦≥−𝑥+1
2
Test points (1,1) and (1, −1)
1 < 3(1) + 1 < 3(−1) +
2 2
1<5 1 < −1
Satisfies Does Not Satisfy
(right of line) (left of line)
10
8
6
4
2
0
-10 -8 -6 -4 -2-2 0 2 4 6 8 10
-4
-6
-8
-10
Step 2: Create the complete graph only including the overlapping shading in the upper right
region of the graph.
10
8
6
4
2
0
-10 -8 -6 -4 -2-2 0 2 4 6 8 10
-4
-6
-8
-10
𝑥 ≤ 5, 𝑥 ≥ 2, 𝑦 − 𝑥 ≤ 2, 𝑦 − 𝑥 ≥ −2
bounded by
0
-10 -8 -6 -4 -2 0 2 4 6 8 10
-2
-4
-6
-8
-10
Step 3: We see that vertices form at the points (−𝟐, 𝟎), (−𝟐, −𝟒), (𝟓, 𝟕), (𝟓,
𝟑). Now, we will plug these values into the objective function.
(−2,0): 𝑧 = 4𝑥 − 2𝑦 + 1
𝑧 = 4(−2) − 2(0) + 1
𝑧 = −7
(−2, −4): 𝑧 = 4𝑥 − 2𝑦 + 1
𝑧 = 4(−2) − 2(−4) + 1
𝑧=1
(5,7): 𝑧 = 4𝑥 − 2𝑦 + 1
𝑧 = 4(5) − 2(7) + 1
𝑧=7
(5,3): 𝑧 = 4𝑥 − 2𝑦 + 1
𝑧 = 4(5) − 2(3) + 1
𝑧 = 15
Step 4: Conclude that the maximum value is 𝒛 = 𝟏𝟓, which occurs at 𝒙 = 𝟓 and 𝒚
= 𝟑. Conclude that the minimum value is 𝒛 = −𝟕, which occurs at 𝒙 = −𝟐 and 𝒚 =
𝟎.
o If the region goes towards infinity and negative infinity, there is no maximum or
minimum. In other words, it cannot be optimized. This only occurs if our
constraints form parallel lines.
Visual Example: