0% found this document useful (0 votes)
2 views

ML-Math-102-Systems-of-Inequalities-and-Linear-Programming

The document provides a comprehensive guide on graphing linear inequalities in two variables, including how to determine half-planes and shade regions that satisfy the inequalities. It also explains the process of graphing systems of linear inequalities and optimizing functions using linear programming, detailing steps to find maximum and minimum values based on constraints. Additionally, it addresses scenarios involving unbounded regions where optimization may not be possible.

Uploaded by

cranejupiter2
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
2 views

ML-Math-102-Systems-of-Inequalities-and-Linear-Programming

The document provides a comprehensive guide on graphing linear inequalities in two variables, including how to determine half-planes and shade regions that satisfy the inequalities. It also explains the process of graphing systems of linear inequalities and optimizing functions using linear programming, detailing steps to find maximum and minimum values based on constraints. Additionally, it addresses scenarios involving unbounded regions where optimization may not be possible.

Uploaded by

cranejupiter2
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 7

1

Systems of Linear Inequalities in


Two Variables
Key
Half-Plane: The region on a side of a line in the 𝑥𝑦-plane.

Definitions

Graphing Linear Inequalities in Two


 How Variables
to Graph Linear Inequalities in Two Variables:

 If the inequality is < or >, make the line dashed.


o 1. Change the inequality sign to an equal sign, then plot the line.

 If the inequality is ≤ or ≥, make the line solid.


o 2. Test a point in one half plane created.
 If it satisfies the inequality, the entire half-plane satisfies the inequality.
 If it does not satisfy the inequality, the entire half-plane does not satisfy
the inequality.
o 3. Test the other half-plane.
o 4. Shade in any half-planes that satisfy the inequality.

𝑦 < 2𝑥 + 3
 Example: Graph the following inequality

Step 1: Change the < to = and plot the line.


𝑦 = 2𝑥 + 3
10
8
6
4
2
0
-10 -8 -6 -4 -2 0 2 4 6 8 10
-2

-4
-6
-8
-10

*Notice that the line is dashed since the inequality is <.


Step 2: Test a point in the half-plane to the left of the line. Let’s use the point (−𝟏, 𝟐)

𝑦 < 2𝑥 + 3
for this example.

Property of Regent University Math Tutoring Lab, Adapted from Textbook


Information, edited Date
2

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.

Step 4: Shade in the half-plane to the right of the line.


10

0
-10 -8 -6 -4 -2 0 2 4 6 8 10
-2

-4

-6

-8

-10

 Graphing Systems of Linear Inequalities in


Two
Variables

𝑥 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.

Property of Regent University Math Tutoring Lab, Adapted from Textbook


Information, edited Date
3

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

Property of Regent University Math Tutoring Lab, Adapted from Textbook


Information, edited Date
4

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

The Linear Programming Model


Key
Definitions
 Optimization: The process of minimizing or maximizing a certain function.
 Linear Programming: The graphical approach of solving optimization problems.
 Objective Function: The function representing what we are trying to optimize
 Constraints: A system of linear inequalities that helps us find feasible solutions.
 Feasible Solutions: Any possible solution or outcome.
 Vertex: The points where the lines in the constraints meet and bound the region of
feasible solutions

Optimizing Using the Linear Programming


 Model
How to Solve an Optimization Problem Using Linear Programming:
o 1. Make sure that you are aware of your objective function and its constraints.
o 2. Graph the constraints (system of inequalities) so that we know what our
feasible solutions are.
o 3. Identify the vertices and plug these values into the objective function.
o 4. Note that the smallest of these values you evaluates is the minimum and the

Example: Find the maximum and minimum value of the function 𝑧 = 4𝑥 − 2𝑦 + 1


largest value is the maximum.

𝑥 ≤ 5, 𝑥 ≥ 2, 𝑦 − 𝑥 ≤ 2, 𝑦 − 𝑥 ≥ −2
bounded by

Property of Regent University Math Tutoring Lab, Adapted from Textbook


Information, edited Date
5

Step 1: Since we are finding the minimum and maximum of 𝒛 = 𝟒𝒙 − 𝟐𝒚 + 𝟏,

maximum and minimum 𝒛-values when 𝒙 and 𝒚 are constrained.


this makes it our objective function. In other words, we are trying to find the

Since this function is bounded by 𝒙 ≤ 𝟓, 𝒙 ≥ 𝟐, 𝒚 − 𝒙 ≤ 𝟐, and 𝒚 − 𝒙 ≥


−𝟐, these are the constraints.

Step 2: Graph the system of inequalities (constraints).


10

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

Property of Regent University Math Tutoring Lab, Adapted from Textbook


Information, edited Date
6

𝑧 = 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 𝒚 =
𝟎.

Optimizing Using the Linear Programming


Model in Unbounded Regions
 If a given region is unbounded, that means that there is not an exact shape and
your shaded region continues to go towards infinity or negative infinity.
o If the region goes towards infinity, there is no maximum.
 Visual Example:

o If the region goes towards negative infinity, there is no minimum.


 Visual Example:

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.

Property of Regent University Math Tutoring Lab, Adapted from Textbook


Information, edited Date
7

 Visual Example:

Property of Regent University Math Tutoring Lab, Adapted from Textbook


Information, edited Date

You might also like