Section 7.
1 Graphing Linear Inequalities in Two Variables
In MML 7.1 Reading Assignment, watch “Example: Solve the linear inequality and graph its solution”
Did you notice that the inequality changes direction in problem (b). How do you know when the inequality
changes directions?
Solving linear inequalities is a pre-requisite topic for graphing linear inequalities in two variables. After
watching the video, you can review more solving linear inequalities in section 2.4 (page 95-98) of your
textbook.
Read section 7.1 pages 334-335 examples 1 & 2. Copy the blue box on page 335 in the space below
Watch “Example: Graphing linear inequality” and take notes.
Read example 4 on page 336.
Describe what the graph of y ≥ 2 looks like.
Describe what the graph of x ≤ 1 looks like.
Read about systems of inequalities on page 336-337.
Define feasible region
Chapter 7 Guided Notes – Math 1324 1
Watch the video “Example: Graph liner systems of 2 inequalities” and take notes.
Watch the video “Example: Find the feasible region in 1st quadrant” and take notes.
Watch the video “Investment word problem” and take notes. It is very important for this chapter that you
are able to write inequalities from word problems.
Chapter 7 Guided Notes – Math 1324 2
Section 7.2 – Linear Programming: The Graphical Method
Read section 7.2 pages 342-347 in your textbook and define the following terms:
Constraints: The linear inequalities or equations or restrictions on the variables in the linear programming
problems are called Constraints.
Linear Programming: Linear programming is a mathematical modelling technique in which linear function is
optimized (Maximized or minimized) when subjected to various constraints.
Objective Function: The function to be optimized in linear programming is called Objective Function.
Corner Point: A Corner Point is a point in the feasible region where the boundary lines of two constraints
cross.
Bounded: The feasible region is called Bounded if it is enclosed by boundary lines on all sides. Linear
programming problems with bounded regions always have solutions.
Unbounded: The feasible region is called Unbounded if it is not enclosed by boundary lines from all sides.
There is no way to maximize the value of the objective function if the region is unbounded.
Corner Point Theorem: If the feasible region is bounded, then the objective function has both a maximum and a
minimum value and each occurs at one or more corner points. If the feasible region is unbounded, the objective
function may not have a maximum or minimum. But if it exists, it will occur at one or more corner points.
Watch videos “Example: Given a bounded region, maximize and minimize an objective function” and
“Example: Given an unbounded region, maximize and minimize an objective function” and take notes.
Chapter 7 Guided Notes – Math 1324 3
On page 344 you have the following steps for solving a linear programming problem graphically.
Watch the video “Example: Solve a linear programming application with a bounded region” and take notes
of how each step is completed.
Chapter 7 Guided Notes – Math 1324 4
Section 7.3 – Applications of Linear Programming
In 7.3 Reading Assignment watch the video “Example: Writing the Constraints” and take notes. Pay close
attention to how variables are defined before inequalities are written.
Read section 7.3 pages 348-352, examples 1 – 3. While reading the examples see if you can define the
variables, write the objective function, and write the constraints on your own.
Example 1:
Variables: x = ___________________________
y = ___________________________
Constraints (inequalities):
_____________________________________
_____________________________________
_________________ , __________________
Objective Function: (maximize) z = _________________
Graph:
Corner Points: ( ____, ____ ) ( ____, ____ ) ( ____, ____ ) ( ____, ____ )
Maximum:
The maximum storage space is ______ cubic feet. The manager should purchase _________ Ace cabinets and
______ Excello cabinets.
Chapter 7 Guided Notes – Math 1324 5
Example 2:
Variables: x = ___________________________
y = ___________________________
Constraints (inequalities):
_____________________________________
_____________________________________
_____________________________________
_________________ , __________________
Objective Function: (maximize) z = _________________
Graph: (did you notice that this region is unbounded?)
Corner Points:
Minimum:
The minimum cost is $___________. They should use ________ units of food A and _______ units of food B.
Example 3:
Variables:
Constraints:
Objective Function:
Graph:
Corner Points:
Minimum:
Interpret in a complete sentence:
Chapter 7 Guided Notes – Math 1324 6
Watch the video “Example: Application to maximizing revenue/profit” and take notes.
Chapter 7 Guided Notes – Math 1324 7
Section 7.4 – The Simplex Method: Maximization
In 7.4 Reading assignment, read section 7.4 pages 354-356 including example 1 for an introduction to the
first part of the simplex method.
The simplex method is used for problems with many variables. Instead of using x and y to define our variables
we commonly use x1, x2, x3, etc.
Simplex method can be used ONLY IF a problem is written in standard maximum form.
Example 1 goes over how to set up a simplex problem by introducing slack variables and writing an initial
simplex tableau.
After reading example 1, watch the two videos “Example: Use slack variables to convert constraints to
equations” and “Example: Write the initial simplex tableau”
Chapter 7 Guided Notes – Math 1324 8
Read pages 356-359 including examples 2, 3, 4, & 5 and define the following terms. In your definition be
sure to describe how to identify each of these entries in the simplex matrix.
Indicators
Pivot column
Pivot row
Pivoting
Note: When pivoting your goal is to work on the pivot column and get a 1 in the pivot row and 0’s in all
other entries of the column. Do not use row swap when pivoting!
Watch the videos “Example: Find the pivot in a given simplex matrix” and “Example: Use the indicated
entry as the pivot and perform the pivoting” and take notes.
Chapter 7 Guided Notes – Math 1324 9
Read pages 359-361Reading the solution, including example 5 and write down the 9 steps for using the
simplex method from page 360-361. Then watch the video “Example: Use the simplex method to solve a
linear programming problem.
Steps for Simplex Method:
Chapter 7 Guided Notes – Math 1324 10
Section 7.5 Maximization Applications
Read section 7.5 including examples 1, 2, & 3. Then in MML 7.5 Reading Assignment watch the videos
“Example: Application to Nutrition” and “Application to Maximizing Profit/Income”
Chapter 7 Guided Notes – Math 1324 11
Chapter 7 Guided Notes – Math 1324 12