Chapter 6

Linear Inequalities and Linear

Programming

Section 2
Systems of Linear Inequalities in Two Variables
 Solving Systems of
Linear Inequalities Graphically

▪ We now consider systems of linear inequalities such as

x+y>6
2x – y > 0
▪ We wish to solve such systems graphically, that is, to find
the graph of all ordered pairs of real numbers (x, y) that
simultaneously satisfy all the inequalities in the system.
▪ The graph is called the solution region for the system
(or feasible region.)
▪ To find the solution region, we graph each inequality in the
system and then take the intersection of all the graphs.

2
 Graphing a System of
Linear Inequalities: Example

To graph a system of linear inequalities such as

−1
y x+2
2
x−4 y
we proceed as follows:
Graph each inequality on the same axes. The solution is the
set of points whose coordinates satisfy all the inequalities of
the system. In other words, the solution is the intersection of
the regions determined by each separate inequality.

3
Graph of Example

The graph of the first inequality

y < –(1/2)x + 2 consists of the region
shaded yellow. It lies below the dotted
line y = –(1/2)x + 2.
The graph of the second inequality is
the blue shaded region is above the
solid line x – 4 = y.
The graph is the region which is
colored both blue and yellow.

4
 Corner Points

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

solution region that is the intersection of two boundary
lines. In the previous example, the solution region had a
corner point of (4,0) because that was the intersection of
the lines y = –1/2 x + 2 and y = x – 4. Corner point

5
 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. The previous
example had an unbounded solution region because it
extended infinitely far to the left (and up and down.) We will
now see an example of a bounded solution region.

6
 Graph of More Than Two
Linear Inequalities

To graph more than two linear inequalities, the same

procedure is used. Graph each inequality separately. The
graph of a system of linear inequalities is the area that is
common to all graphs, or the intersection of the graphs of the
individual inequalities.
Example:

7
 Graph of More Than Two
Linear Inequalities

To graph more than two linear inequalities, the same

procedure is used. Graph each inequality separately. The
graph of a system of linear inequalities is the area that is
common to all graphs, or the intersection of the graphs of the
individual inequalities.
Example:

8
 Application

Suppose a manufacturer makes two types of skis: a trick ski and

a slalom ski. Suppose each trick ski requires 8 hours of design
work and 4 hours of finishing. Each slalom ski requires 8 hours
of design and 12 hours of finishing. Furthermore, the total
number of hours allocated for design work is 160, and the total
available hours for finishing work is 180 hours. Finally, the
number of trick skis produced must be less than or equal to 15.
How many trick skis and how many slalom skis can be made
under these conditions? How many possible answers? Construct
a set of linear inequalities that can be used for this problem.

9
 Application
Solution

Let x represent the number of x and y must

trick skis and y represent the both be positive
number of slalom skis. Then the
Number of
following system of linear
trick skis has
inequalities describes our to be less than
problem mathematically. or equal to 15
Actually, only whole numbers
Constraint on
for x and y should be used, but
Constraint on the the total
we will assume, for the moment number of number of
that x and y can be any positive finishing hours design hours
real number.

10
 Application
Graph of Solution

The origin satisfies all the inequalities, so for each of the lines
we use the side that includes the origin.

The intersection of all

graphs is the yellow
shaded region.
The solution region is
bounded and the corner
points are (0,15), (7.5,
12.5), (15, 5), and (15, 0)

11
12
13
14
 Chapter 5

Linear Inequalities and Linear

Programming

Linear Programming in Two Dimensions: A

Geometric Approach
 Linear Programming in Two
Dimensions: A Geometric Approach

In this section, we will explore applications which utilize

the graph of a system of linear inequalities.

16
 A Familiar Example
Suppose a manufacturer makes two types of Vehicles: a
bicycle and a motorcycle. Each bicycle requires 8 hours
of design work and 4 hours of finishing. Each
motorcycle requires 8 hours of design and 12 hours of
finishing. Furthermore, the total number of hours
allocated for design work is 160 and the total available
hours for finishing work is 180. Finally, the number of
bicycle produced must be less than or equal to 15. How
many bicylce and how many motorcycle can be made
under these conditions?
Now, here is the twist: Suppose the profit on each
bicycle is $5 and the profit for each motorcycle is $10.
How many each of each type should the manufacturer
produce to earn the greatest profit? 17
 Linear Programming Problem

This is an example of a linear programming problem. Every

linear programming problem has two components:
1. A linear objective function is to be maximized or minimized.
In our case the objective function is Profit = 5x + 10y (5 dollars
profit for each trick ski manufactured and $10 for every slalom
ski produced).
2. A collection of linear inequalities that must be satisfied
simultaneously. These are called the constraints of the problem
because these inequalities give limitations on the values of x
and y. In our case, the linear inequalities are the constraints.

18
 Constraints

x and y have to
be positive
The number of trick skis
must be less than or
equal to 15 Design constraint: 8
hours to design
each trick ski and 8
hours to design
Finishing constraint: 4 hours each slalom ski.
for each trick ski and 12 hours
for each slalom ski.
19
 Linear Programming Problem
(continued)

3. The feasible set is the set of all points that are possible
solutions. In this case, we want to determine the value(s) of x, the
number of trick skis and y, the number of slalom skis that will
yield the maximum profit. Only certain points are eligible. Those
are the points within the common region of intersection of the
graphs of the constraining inequalities. Let’s return to the graph
of the system of linear inequalities. Notice that the feasible set is
the yellow shaded region.
Our task is to maximize the profit function P = 5x + 10y by
producing x trick skis and y slalom skis, but use only values of x
and y that are within the yellow region graphed in the next slide.

20
The Feasible Set

21
 Maximizing the Profit

The profit is given by P = 5x + 10y.

The equation k = 5x + 10y represents a line with slope (-1/2). For
each point (x, y) on this line, the profit equals k. This is called an
constant-profit line. As the profit k increases, the line shifts
upward by the amount of increase while remaining parallel to all
other constant-profit lines.
What we are attempting to do is to find the largest value of k
possible.
The graph on the next slide shows a few isoprofit lines. The
maximum value of profit occurs at a corner point - a point of
intersection of two lines.

22
 Constant-profit Lines

The exact point of intersection of the two lines is (7.5,12.5).

Since x and y must be whole numbers, we round the answer
down to (7,12).

23
 Maximizing the Profit
(continued)

The maximum value of the profit function in this example

was at the corner point, (7.5, 12.5), but since we cannot
produce a fraction of a ski, we will round down to (7, 12). We
cannot exceed the constraints, so we can’t round up.
Thus, the manufacturer should produce 7 trick skis and 12
slalom skis to achieve maximum profit.
What is the maximum profit?
P = 5x + 10y
P = 5(7)+10(12) = 35 + 120 = 155.

24
 General Result

▪ If a linear programming problem has a solution, it is located at

a corner point of the set of feasible solutions. If a linear
programming problem has more than one solution, at least
one of them is located at a corner point of the set of feasible
solutions.
▪ If the set of feasible solutions is bounded, as in our example,
the solution of the linear programming problem will exist.
Bounded means that the region can be enclosed in a circle.
▪ If the set of feasible solutions is not bounded, then the solution
may or may not exist. Use the graph to determine whether a
solution exists or not.

25
 Constructing a Model for a Linear
Programming Problems

1. Introduce decision variables.

2. Summarize relevant material in table form, relating columns
to the decision variables, if possible.
3. Determine the objective and write a linear objective function.
4. Write problem constraints using linear equations and/or
inequalities.
5. Write non-negative constraints.

26
 Geometric Method for Solving
Linear Programming Problems

1. Graph the feasible region. Then, if an optimal solution exists,

find the coordinates of each corner point.
2. Construct a corner point table listing the value of the
objective function at each corner point.
3. Determine the optimal solution(s) from the table in step 2.
4. For an applied problem, interpret the optimal solution(s) in
terms of the original problem.

27
 Example 1

Maximize the quantity z = x + 2y subject to the constraints

x + y ≥ 1, x ≥ 0, y ≥ 0.

28
 Example 1
(no solution)

Maximize the quantity z = x + 2y subject to the constraints

x + y ≥ 1, x ≥ 0, y ≥ 0.
1. The objective function is z = x + 2y, which is to be maximized.
2. Graph the constraints: (see next slide)
3. Determine the feasible set (see next slide)
4. Determine the corner points of the feasible set. There are two
corner points from our graph: (1,0) and (0,1)
5. Determine the value of the objective function at each vertex.
At (1, 0), z = (1) + 2(0) = 1; at (0, 1), z = 0 + 2(1) = 2.

29
 Example 1
(continued)

The pink lines are the graphs of z = x + 2y for z = 2, 3 and 4.

We can see from the graph there is no feasible point that makes
z largest. The region is unbounded.
We conclude that this
linear programming
problem has no solution.

30
 Example 2

A manufacturing plant makes two types of boats, a

two-person boat and a four-person boat. Each two-
person boat requires 0.9 labor-hours from the cutting
department and 0.8 labor-hours from the assembly
department. Each four-person boat requires 1.8
labor-hours from the cutting department and 1.2
labor-hours from the assembly department. The
maximum labor-hours available per month in the
cutting department and the assembly department are
864 and 672, respectively. The company makes a
profit of $25 on each two-person boat and $40 on
each four-person boat How many boats of each kind
should the company produce in order to maximize
profit?

31
 Example 2

A manufacturing plant makes two types of boats, a

two-person boat and a four-person boat. Each two-
person boat requires 0.9 labor-hours from the cutting
department and 0.8 labor-hours from the assembly
department. Each four-person boat requires 1.8
labor-hours from the cutting department and 1.2
labor-hours from the assembly department. The
maximum labor-hours available per month in the
cutting department and the assembly department are
864 and 672, respectively. The company makes a
profit of $25 on each two-person boat and $40 on
each four-person boat How many boats of each kind
should the company produce in order to maximize
profit?

32
 Example 2
(unique solution)

1. Write the objective function.

2. Write the problem constraints and the nonnegative
constraints.
3. Graph the feasible region. Find the corner points.
4. Test the corner points in the objective function to find the
maximum profit.
Answers: 1. Objective Function
If x is the number of two-person boats and y is the number of
four-person boats, and the company makes a profit of $25 on
each two-person boat and $40 on each four-person boat, the
objective function is P = 25x + 40y.
33
 Example 2
(continued)

2. Constraints
Since each 2-person boat requires 0.9 labor hours from the
cutting department and each 4-person boat requires 1.8 hour
of cutting, and the maximum hours available in the cutting
department is 864, we have 0.9x + 1.8y < 864
Since each 2-person boat requires 0.8 labor-hours from
assembly and each 4-person requires 1.2 hour from assembly,
and the maximum hours available in assembly is 672, we
have 0.8x + 1.2y < 672.
Also, x > 0 and y > 0.

34
 Example 2
(continued)
.8x + 1.2y = 672
500
3. Feasible region
The yellow shaded area
is the feasible region. .9x + 1.8y = 864

Corner points are

(0, 0), (0, 480),
(480, 240), and (840, 0)

35
 Example 2
(continued)

4. Maximum Profit

Corner point Value of P = 25x + 40y

(0,0) 0

(0,480) 40(480) = $19,200

(480,240) 25(480) + 40(240) =

$21,600
This is max. profit
(840,0) 25(840) = $21,000
36
 Example 3

Maximize z = 4x + 2y subject to
2x + y < 20
10x + y > 36
2x + 5y > 36
x, y > 0

37
 Example 3
(multiple solution)

Maximize z = 4x + 2y subject to
The feasible
36
2x + y < 20 10x+y=36 solution is shaded
10x + y > 36 green. The corner
2x+y=20 points are (2,16),
2x + 5y > 36 (8,4) and (3,6).
x, y > 0 2x+5y=36
10
Test corner points:
(2,16) z = 4(2) + 2(16) = 40 These are both
(8,4) z = 4(8) + 2(4) = 40 } optimal.
(3,6) z = 4(3) + 2(6) = 2
38
 Example 3
(continued)

The solution to example 3 is a

multiple optimal solution. In
general, if two corner points are
both optimal solutions to a linear
programming problem, then any
point on the line segment joining
them is also an optimal solution.
Thus any point on the line
2x + y = 20, where 2 < x < 8, such
as (3, 14), would be an optimal
solution.

39
 Exercise-1

An electronics firm decides to launch two models of

a phone, Oppo and Vivo. The cost of making each
device of type Oppo is $125 and the cost for Vivo is
$160. The firm recognises that this is a risky venture,
so it decides to limit the total weekly production
costs to $4000. Also, due to a shortage of skilled
labour, the total number of tablets that the firm can
produce in a week is at most 30. The profit made on
each device is $600 for Oppo and $700 for Vivo.
How should the firm arrange production to maximise
profit? 40
 Exercise-2

An insurance company employs full- and part-time

staff, who work 40 and 20 hours per week,
respectively. Full-time staff are paid $800 per week
and part-time staff $320. In addition, it is company
policy that the number of part-time staff should not
exceed one-third of the number of full-time staff. If
the number of worker-hours per week required to
deal with the company’s work is 900, how many
workers of each type should be employed in order to
complete the workload at minimum cost?
41
 Exercise-3

A manufacturer produces two models of racing bike,

B and C, each of which must be processed through
two machine shops. Machine shop 1 is available for
120 hours per month and machine shop 2 for 180
hours per month. The manufacture of each bike of
type B takes six hours in shop 1 and three hours in
shop 2. The corresponding times for C are 4 and 10
hours, respectively. If the profit is $180 and $220 per
bike of type B and C, respectively, how should the
manufacturer arrange production to maximise total
profit? 42
 Exercise-4

A small firm manufactures and sells litre cartons of non-

alcoholic cocktails, ‘The Caribbean’ and ‘Mr Fruity’, which sell
for $1 and $1.25, respectively. Each is made by mixing fresh
orange, pineapple and apple juices in different proportions. The
Caribbean consists of one part orange, six parts pineapple and
one part apple. Mr Fruity consists of two parts orange, three
parts pineapple and one part apple. The firm can buy up to 300
litres of orange juice, up to 1125 litres of pineapple juice and up
to 195 litres of apple juice each week at a cost of $0.72, $0.64
and $0.48 per litre, respectively. Find the number of cartons of
‘The Caribbean’ and ‘Mr Fruity’ that the firm should produce to
maximise profits. You may assume that non-alcoholic cocktails
are so popular that the firm can sell all that it produces.
43
A craft studio makes glass bowls and plates, and it can sell all of the
products that it makes each week. Glassware is made in two stages. In the
first stage molten glass is taken from a furnace and placed at the end of a
blowpipe. Skilled glassblowers then mould the glass into the desired
shape. During the second stage the glass is allowed to cool in a controlled
way inside a second furnace (called an annealer) which helps to reduce
stress and prevent the glass from cracking. The studio employs two
glassblowers who each work a 35-hour week, and the total time available
each week for annealing is 130 hours. The main raw material used in
glassmaking is silica sand, and the studio orders 45 kg each week. A glass
bowl and plate each require 1 kg of sand. It takes a glassblower two hours
to make a bowl and one hour to make a plate. The time needed to cool a
bowl in an annealer is four hours and a plate requires one hour. The profit
made from selling a bowl and a plate is $150 and $100, respectively. Of
course, if there were no restrictions on either time or materials, the studio
would be able to maximise weekly profit by making only glass bowls.
However, with limited resources, we use linear programming to decide on
44
the best combination.