Chapter 5

Chapter 5
Linear
Inequalities and
Linear
Programming
Section 1
Linear Inequalities in
Two Variables
Barnett, College Mathematics for Business, Economics, Life Sciences, and Social Sciences, 14e
Copyright © 2019, 2015, 2011 Pearson Education, Inc. Slide 1
Graphing Linear Inequalities in
Two Variables
In the previous chapter, we graphed first degree equations
such as y = 2x – 3 and 2x – 3y = 5.
In this section, we graph first-degree inequalities such as:

y < 2x – 3 and 2x – 3y > 5
Graphing inequalities is similar to graphing equations.
We first discuss some important subsets of a rectangular

coordinate plane.
Two Variables
A line divides the plane into two regions called half-planes.
As shown in the
graphic, a vertical line
divides it into left and
right half-planes with
the vertical line as the
boundary line.
Two Variables
A line divides the plane into two regions called half-planes.
A non-vertical line
divides the plane into
upper and lower half-
planes with the dividing
line as the boundary
line.
Two Variables
Find the half-planes determined by the linear equation
y – x = –2
Rewrite the equation as

y = x – 2 and graph the
line.
Each given value of x
has exactly one value y
so that (x, y) is on the
boundary line.
For example, when x = 4, y = 2 giving the point (4, 2) which

is on the boundary line.
Two Variables
y – x = –2
For each point on the
line, all points having
the same x value and
smaller y values will lie
below the line in the
blue region in the
figure.
This blue region corresponds to the solution of the inequality

y < x – 2.
Two Variables
y – x = –2
For each point on the
line, all points having
the same x value and
larger y values will lie
below the line in the tan
region in the figure.
This tan region corresponds to the solution of the inequality

y > x – 2.
Graphs of Four Forms of
Inequalities
For the linear equation, y = x – 2, replacing the = sign with >,
>, <, or < gives the four inequalities:
y>x–2 y>x–2 y<x–2 y<x–2

The graph of each of these is a half-plane, excluding the
boundary line for > and < and including the boundary line for
> and <.
y>x–2 y>x–2 y<x–2 y<x–2

Theorem 1 Graphs of Linear
Inequalities
The graph of the linear inequality

Ax + By < C or Ax + By > C
with B ≠ 0, is either the upper half-plane or the lower half-
plane (but not both) determined by the line Ax + By = C.
If B = 0 and A ≠ 0, the graph of

Ax < C or Ax > C
is either the left-half plane or the right half-plane (but not
both) determined by the line Ax = C.
Procedure Graphing Linear
Inequalities
Step 1 First graph Ax + By = C as a dashed line if equality is
not included in the original statement, or as a solid line if
equality is included.
Step 2 Choose a test point anywhere in the plane not on the

line [the origin (0, 0) usually requires the least computation],
and substitute the coordinates into the inequality.
Step 3 Does the test point satisfy the original inequality? If

so, shade the half-plane that contains the test point. If not,
shade the opposite half-plane.
Example 1 Graphing a Linear
Inequality
Graph 2x – 3y < 6
Solution
Step 1
Graph 2x – 3y = 6 as
a solid line since
equality is included in
the original statement.
This result is shown
in the figure.
Inequality
Graph 2x – 3y < 6
Solution
Step 2
Select a test point above or below
the line. The point (0, 0) requires (0, 0)
the least computation.
Substituting (0, 0) into
2x – 3y < 6 gives 0 < 6, a true
statement.
The half-plane containing the test
point (0, 0) is in the solution set.
Inequality
Solution
Step 3 Shade the half-
plane containing the test
point (0, 0).
The line with equation

2x – 3y = 6 and the half-
plane containing (0, 0)
form the graph of
2x – 3y < 6
Example 2A Graphing a Linear
Inequality
Graph y > –3
Solution Graph the horizontal line with

equation y = –3 as a dashed line since
equality is not included in the original
inequality.
Select a test point (0, 0). Substituting x = 0,
y = 0 in the inequality produces a true
statement, so the point (0, 0) is in the
solution set.
Since (0, 0) is in the solution set, shade the
region above the horizontal line to
represent the solution set to y > –3.
Example 2B Graphing a Linear
Inequality
Graph 2x < 5
Solution Graph the vertical line with

equation 2x = 5 as a solid line since
equality is included in the original
inequality.
Select a test point (0, 0). Substituting x = 0,
y = 0 in the inequality produces a true
statement, so the point (0, 0) is in the
solution set.
region to the left of the horizontal line to
represent the solution set to 2x < 5.
Example 2C Graphing a Linear
Inequality
Graph x < 3y
Solution Graph the line x = 3y as a solid

line since equality is included in the
original inequality.
Since the line passes through the origin, we
must use a different test point from (0, 0).
The test point (0, 2) is in the solution set.
upper half-plane to represent the solution
set to x < 3y.
Example 3 Interpreting a Graph
Find the inequality with graph shown in the figure.
Write the boundary line in the form Ax + By = C, where A, B,
and C are integers, before stating the inequality.
The boundary line contains the
points (0, 6) and (8, 0) so the
line has slope
6 3
m= 
8 4
and y intercept b = 6.
The boundary line equation is
3
y   x  6.
4
This simplifies to 3x + 4y = 24.
Example 3 Interpreting a Graph
With boundary line equation 3x + 4y = 24, observe that the
point (0, 0) is in the shaded region and that the boundary line
is solid.
The graph in the figure is the

graph of 3x + 4y < 24.
Example 4 Application--Sales
A concert promoter wants to book a band for a stadium
concert. An admission ticket to the stadium playing field will
cost $125, and a ticket for a seat in the stands will cost $175.
The band requires a minimum of $700,000 in ticket sales.
How many tickets of each type must be sold to meet the
band’s guarantee?
Write this answer as a linear inequality and draw its graph.
Solution
Let x = Number of tickets sold for the playing field
Let y = Number of tickets sold for seats in the stands
125x + 175y > 700,000 (guarantee at least $700,000)
Example 4 Application—Sales
continued
125x + 175y > 700,000 Divide both sides by 25
5x + 7y > 28,000
Use the three-step procedure to graph this inequality.
Step 1 Graph 5x + 7y = 28,000 as a

solid line.
Step 2 Substituting x = 0, y = 0 into

the inequality produces a false
statement, so the point (0, 0) is not in
the solution set of the inequality.
Shade the upper half-plane.
Example 4 Application—Sales
continued
Step 3 Observe that since x and y

represent numbers of tickets sold, it
is reasonable that only the first
quadrant contains viable solutions as
shown in the graph below.
It follows that x > 0 and y > 0,
and because x and y represent
numbers of tickets sold, x and
y cannot be fractions.
Thus, (x, y) solutions are
nonnegative integer values of
points in the shaded region or
on the border lines.
Chapter 5
Linear
Inequalities and
Linear
Programming
Section 2
Systems of Linear
Inequalities in
Two Variables
Solving Systems of Linear
Inequalities Graphically
For a system of linear inequalities such as x y 6
2x  y  0
the solution is the collection of all ordered pairs of real
numbers (x, y) that simultaneously satisfy all the inequalities
in the system.
When we solve such systems graphically, we find a graph of

all solutions which is called the solution region.
Graph each inequality in the system.
The intersection of all of the graphs in the system is the

solution.
Example 1 Solving a System of
Linear Inequalities Graphically
Solve the system of linear inequalities graphically:
x y 6
2x  y  0
Solution Graph the line

x + y = 6 as a solid line
and shade the region
that satisfies the linear
inequality x + y > 6.
continued
x y 6
2x  y  0
Graph the line 2x – y = 0 as

a solid line and shade the
region that satisfies the
linear inequality 2x – y > 0.
continued
x y 6
2x  y  0
The region of the graph that is

the intersection (where the
individual graphs intersect) is
the solution to the system.
The intersection point (2, 4) is

found by solving the system as
equations.
Definition Corner Point
A corner point of a solution region is a point in the solution

region that is the intersection of two boundary lines.
The point (2, 4) in Example 1 is the

only corner point in the solution region.
Solve the system of linear inequalities 2 x  y  22
graphically and find the corner points: x  y  13
2 x  5 y  50
Solution The inequalities x > 0 and y > 0 x0
indicate that the solution region will lie in y0
the first quadrant.
2 x  y  22
Graph the lines
x  y  13
2 x  5 y  50
Graph the lines 2 x  y  22

x  y  13
2 x  5 y  50
The test point (0, 0) is a solution

to each of the inequalities.
2 x  y  22
x  y  13
2 x  5 y  50
The shaded region shown in the figure
is the solution to the system.
The corner points (0, 0), (0, 10),
and (11, 0) can be determined
from the graph.
The other two turning points are
found by solving the systems:
2 x  5 y  50 2 x  y  22
and
x  y  13 x  y  13
The solutions to these systems are (5, 8) and (9, 4).
The intersection of 2x + y = 22, and 2x + 5y = 50 is not a part

of the solution region, so it not a corner point.
Definition Bounded and
Unbounded Solution Regions
A solution region of a system of linear inequalities is

bounded if it can be enclosed within a circle.
If it cannot be enclosed within a circle, it is unbounded.
Example 3 Application-Nutrition
A patient on a brown rice and skim milk diet is required to
have at least 800 calories and at least 32 grams of protein per
day.
Each serving of brown rice contains 200 calories and 5 grams
of protein.
Each serving of skim milk contains 80 calories and 8 grams of
protein.
How many servings of each food should be eaten per day to
meet the minimum daily requirements?
Solution To answer this question we need to solve for x and y,
where
x = number of daily servings of brown rice
y = number of daily servings of skim milk
continued
We arrange the information given in the problem in a table
(columns correspond to x and y).
Brown Rice x Skim Milk y Minimum Daily Req.

Calories 200 cal/svg 80cal/svg 800 cal
Protein 5 g/svg 8 g/svg 32 g
Minimum calorie requirement (brown rice plus skim milk),

200x + 80y > 800
Minimum protein requirement (brown rice plus skim milk),
5x + 8y > 32
Both x and y are nonnegative.
continued
Solve the system of inequalities 200 x  80 y  800
The graph of the system of 5 x  8 y  32
inequalities is shown with the x 0
solution region shaded.
Each point in the shaded region y 0
including the boundaries is a
solution to the system and meets,
or exceeds, the minimum daily
requirements for calories and
protein.
Points outside the shaded region
do not.
The solution is unbounded.
Chapter 5
Linear
Inequalities and
Linear
Programming
Section 3
Linear Programming in
Two Dimensions:
A Geometric Approach
Introduction
Several examples in Section 5.2 are related to a more general

type of problem called a linear programming problem.
Linear programming is a mathematical process that helps
with decision making.
The following detailed example uses an intuitive geometric
approach and gives insight that will be helpful when we move
to a less intuitive algebraic approach (often required for
actually solving real-work problems).
Example 1 Production Scheduling
A manufacturer of lightweight mountain tents makes a

standard model and an expedition model.
Each standard tent requires 1 labor-hour from the cutting
department and 3 labor-hours from the assembly department.
Each expedition tent requires 2 labor-hours from the cutting
department and 4 labor-hours from the assembly department.
The maximum labor-hours available per day in the cutting
and assembly departments are 32 and 84, respectively.
If the company makes a profit of $50 on each standard tent
and $80 on each expedition tent, how many tents of each type
should they make each day to maximize the total daily profit?
We assume that Mathematics
Barnett, College they sell all of
for Business, the tents.
Economics, Life Sciences, and Social Sciences, 14e
.
Copyright © 2019, 2015, 2011 Pearson Education, Inc Slide 37
continued
Solution This is an example of a linear programming problem
Analyzing the question indicates that the objective of
management is to maximize profit.
Because profit amounts differ for the two types of tents,
management must decide on how many of each type should
be made.
We introduce the following decision variables:
Let x = number of standard tents produced per day
y = number of expedition tents produced per day
continued
The manufacturing requirements, objectives, and restrictions
are summarized in a table with the decision variables related
to the columns in the table.
The last line in the table is used to form the objective

function, in this case, the profit P in terms of the decision
variables:
P = 50x + 80y
The form of the objective function suggests that profit can be as
continued
large as we like, just make more tents.
This is not the case since there are limits imposed by available
resources, plant capacity, demand, and so on. These limits are
referred to as problem constraints.
The information in the table indicates two problem constraints:
 daily cutting   daily cutting   maximum labor- 
     
 time for x    time for y 
  hours available 
 standard tents   expedition tents   per day 
     
 daily assembly   daily assembly   maximum labor- 
     
 time for x    time for y 
  hours available 
 standard tents   expedition tents   per day 
     
Represent the objective function, the two problem constraints,
continued
and any other constraints using the decision variables:
Maximize P = 50x + 80y
subject to x  2 y  32
3 x  4 y  84
x, y  0
The graphical solution for this mathematical model is outlined
on the next slide.
continued
The graph of the feasible region
for the linear inequality constraints
in this example is shown.
Choosing a production schedule

(x, y) from the feasible region
allows finding the profit using the
objective function, P = 50x + 80y
For example, choosing (12, 10),
the profit for the day is found to
be $1,400.
We seek the production schedule in the feasible region that
produces maximum profit. Thus, this is a maximization
problem.
continued
For each particular value P assigned to the objective function
P = 50x + 80y, the resulting plot (see the figure) gives a
collection of parallel constant-profit lines.
We write P in slope-intercept form

5 P
y  x
8 80
As P increases, the y intercept
increases and the line moves away
from the origin.
The maximum profit is at the
intersection of the profit line and the
point (20, 6), the optimal solution.
continued
The profit is maximized at the point (20, 6) so the
manufacturer should make 20 standard tents and 6 expedition
tents each day to obtain maximum profit.
P = 50x + 80y = 50(20) + 80(6) = $1,480
The point (20, 6) is called an optimal solution to the problem

because it maximizes the objective profit function and it is in
the feasible region.
In general, maximum profit occurs at one of the corner points.
Note that minimum profit (P = 0) occurs at the corner point
(0, 0).
Procedure
Constructing a Model for an Applied Linear
Programming Problem
Step 1 Introduce decision variables.

Step 2 Summarize relevant material in table form, relating
columns to the decision variables, if possible.
Step 3 Determine the objective and write a linear objective
function.
Step 4 Write problem constraints using linear equations
and/or inequalities.
Step 5 Write nonnegative constraints.
General Description of
Linear Programming
A linear programming problem is concerned with finding
the optimal value (maximum or minimum) of a linear
objective function z of the form z = ax + by, (a and b not
both equal to zero)
The decisions variables x and y are subject to problem
constraints in the form of < or > linear inequalities and
equations.
The decision variables must satisfy the nonnegative
constraints x > 0, y > 0.
The points satisfying both the problem constraints and the
nonnegative is called the feasible region for the problem.
Any point in the feasible region that produces the optimal
value of the objective function is called an optimal solution.
Theorem
Fundamental Theorem 1
of Linear Programming
If the optimal value of the objective function in a linear

programming problem exists, then that value must occur at
one or more of the corner points of the feasible region.
Theorem 2
Existence of Optimal Solutions
(A) If the feasible region for a linear programming

problem is bounded, then both the maximum and the
minimum value of the objective function always exist.
(B) If the feasible region is unbounded and the

coefficients of the objective function are positive, then
the minimum value of the objective function exists but
the maximum value does not.
(C) If the feasible region is empty (that is, no points

satisfy all constraints), then both the maximum value
and the minimum value of the objective function do
not exist.
Geometric Method for Solving
StepLinear Programming
1 Graph the feasible region. Then, ifProblems
an optimal solution
exists according to Theorem 2, find the coordinates of
each corner point.
Step 2 Construct a corner point table listing the value of the

objective function at each corner point.
Step 3 Determine the optimal solution(s) from the table in

Step 2.
Step 4 For an applied problem, interpret the optimal

solution(s) in terms of the original problem.
Example 2 Solving a Linear
(A) Minimize and maximize the function z subject to the
Programming
constraints. z  3x  y
Problem
2 x  y  20
10 x  y  36
2 x  5 y  36
x, y  0
Solution Step 1 Graph the feasible region S. (see the figure)

Since the region S is bounded, by Theorem 2, z has both a
maximum and minimum value on S each occurring at corner
points.
Find coordinates of each corner point.
Programming Problem
Step 2 Evaluate the object function at each corner point.
These results are summarized in the table.
Step 3 Determine the optimal solutions from Step 2.

The minimum value of z is 15 at (3, 6) and the maximum
value of z is 28 at (8, 4).
Programming Problem
Solution Step 1 Graph the feasible region

S. (see the figure)
Since the region S is unbounded, by
Theorem 2, z (positive coefficients) has a
minimum value but no maximum value
on S.
Find coordinates of each corner point.
Programming Problem
Step 2 Evaluate the object function at each corner point.
These results are summarized in the table.
Step 3 Determine the optimal solutions from Step 2.

The minimum value of z is 160 at (4, 6) and at (16, 0).
Example 3 Medication
A hospital patient is required to have at least 84 units of drug
A and 120 units of drug B each day (assume that overdoses
are not harmful).
Each gram of substance M contains 10 units of drug A and 8
units of drug B.
Each gram of substance N contains 2 units of drug A and 4
units of drug B.
Suppose that both M and N contain an undesirable drug D: 3
units per gram in M and 1 unit per gram in N.
How may grams of each of substances M and N should be
mixed to meet the minimum daily requirements and
simultaneously minimize the intake of drug D?
How many units of the undesirable drug D will be in this
mixture?
Example 3 Medication continued
Solution First construct the mathematical model.
Step 1 The decision variables are
x = number of grams of substance M used
y = number of grams of substance N used
Step 2 Summarize relevant material in a table with columns
corresponding to the decision variables.
Step 3 The objective is to minimize the amount of drug D in
the daily dose of the medication.
The linear objective function is C = 3x + y
Step 4 The problem constraints in this problem are

10x + 2y > 84
8x + 4y > 120
Step 5 Add the nonnegative constraints and summarize the
model.
Using the geometric method to solve
Step 1 Graph the feasible region (see the
figure).
Since the feasible region is unbounded
and the coefficients of the objective
function are positive, this minimization
problem has a solution.
Find the corner points of the region.
Step 2 Evaluate the objective

function at each corner point and
summarize in a table (shown).
Step 4 The optimal solution (4, 22) indicates that if we use
4 grams of substance M and 22 grams of substance N, the
requirements of dosage will be met while minimizing the
intake of the undesirable drug D at 34 units.
Any other combination of M and N in the feasible region
results in a larger quantity of the undesirable drug D.

Chapter 5

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Chapter 5

Uploaded by

Copyright:

Available Formats

Chapter 5

In this section, we graph first-degree inequalities such as:

Graphing inequalities is similar to graphing equations.

We first discuss some important subsets of a rectangular

Rewrite the equation as

For example, when x = 4, y = 2 giving the point (4, 2) which

This blue region corresponds to the solution of the inequality

This tan region corresponds to the solution of the inequality

y>x–2 y>x–2 y<x–2 y<x–2

y>x–2 y>x–2 y<x–2 y<x–2

The graph of the linear inequality

If B = 0 and A ≠ 0, the graph of

Step 2 Choose a test point anywhere in the plane not on the

Step 3 Does the test point satisfy the original inequality? If

The line with equation

Solution Graph the horizontal line with

Solution Graph the vertical line with

Solution Graph the line x = 3y as a solid

The graph in the figure is the

125x + 175y > 700,000 (guarantee at least $700,000)

Use the three-step procedure to graph this inequality.

Step 1 Graph 5x + 7y = 28,000 as a

Step 2 Substituting x = 0, y = 0 into

Step 3 Observe that since x and y

When we solve such systems graphically, we find a graph of

Graph each inequality in the system.

The intersection of all of the graphs in the system is the

Solution Graph the line

Graph the line 2x – y = 0 as

The region of the graph that is

The intersection point (2, 4) is

A corner point of a solution region is a point in the solution

The point (2, 4) in Example 1 is the

Graph the lines 2 x  y  22

The test point (0, 0) is a solution

The solutions to these systems are (5, 8) and (9, 4).

The intersection of 2x + y = 22, and 2x + 5y = 50 is not a part

A solution region of a system of linear inequalities is

Brown Rice x Skim Milk y Minimum Daily Req.

Minimum calorie requirement (brown rice plus skim milk),

Several examples in Section 5.2 are related to a more general

A manufacturer of lightweight mountain tents makes a

The last line in the table is used to form the objective

Choosing a production schedule

We write P in slope-intercept form

The point (20, 6) is called an optimal solution to the problem

Step 1 Introduce decision variables.

If the optimal value of the objective function in a linear

(A) If the feasible region for a linear programming

(B) If the feasible region is unbounded and the

(C) If the feasible region is empty (that is, no points

Step 2 Construct a corner point table listing the value of the

Step 3 Determine the optimal solution(s) from the table in

Step 4 For an applied problem, interpret the optimal

Solution Step 1 Graph the feasible region S. (see the figure)

Step 3 Determine the optimal solutions from Step 2.

Solution Step 1 Graph the feasible region

Step 3 Determine the optimal solutions from Step 2.

Step 4 The problem constraints in this problem are

Step 2 Evaluate the objective

You might also like