BMT1014

Managerial Mathematics
Chapter 2
Linear Programming
2 Linear Programming
• Graphing Systems of Linear
Inequalities in Two Variables
• Linear Programming Problems
• Graphical Solution

1820 2
 Graphing Linear Inequalities
Ex. Graph y  2 x  1 Notice that the
line (=) is part
y  2 x  1 of the solution

Also, any point in the

lower half-plane
satisfies the
inequality so this
region is shaded.
1820 3
 Graphing Linear Inequalities
Ex 1b. Graph y  2x 1 The line (=) is
not part of the
solution (so it
is dashed.

Any point in the

lower half-plane
satisfies the
inequality.
1820 4
Procedure for Graphing Linear
Inequalities
1. Draw the graph of the equation obtained by
replacing the inequality symbol with an equal sign.
Make the line dashed if the inequality symbol is <
or >, otherwise make it solid.
2. Pick a test point in one of the half planes,
substitute the x and y values into the inequality
(use the origin whenever possible).
3. If the inequality is satisfied, shade the half plane
containing the test point otherwise shade the other
half plane. 1820 5
Ex 1c. Graph 3x  2 y  6

Dashed since <

Test (0,0): 3(0)+2(0) < 6

True so shade region

containing (0,0)

1820 6
Ex 1d. Graph x  2 Ex 1e. Graph y  3

1820 7
Ex 2. Graph the solution set for x  2 y  1
the system: 3x  2 y  6
3x  2 y  6

x  2y 1

Points must satisfy both inequalities

(overlap of individual shaded
regions) 1820 8
Bounded Unbounded
Region Region

1820 9
 Exercise 1
Find the graphical solution for each inequality.
a) 3x  4 y  2
b) 3 x  5 y  11
c) 2x  y  6

1820 10
Linear Programming Problem

A linear programming problem consists of

a linear objective function to be maximized
or minimized, subject to certain constraints
in the form of linear equalities or
inequalities.

1820 11
Ex 3. A small company consisting of two carpenters
and a finisher produce and sell two types of tables:
type A and type B. The type-A table will result in a
profit of $50, and each type-B table will result in a
profit of $54. A type-A table requires 3 hours of
carpentry and 1 hour of finishing. A type-B table
requires 2 hours of carpentry and 1 hour of finishing.
Each day there are 16 hours available for carpentry
and 8 hours available for finishing. How many
tables of each type should be made each day to
maximize profit?

1820 12
Organize the Information:
Table A Table B Time
Carpentry 3 2 16 hours
Finishing 1 1 8 hours
Profit/table $50 $54

Let x = # type A and y = # type B.

The Profit to Maximize (in dollars) is given by:
P = 50x + 54y

1820 13
The constraints are given by:
Carpentry 3x  2 y  16
Finishing x y 8
Also so that the number of units is not less than 0:
x  0, y  0
So we have:
Maximize P  50 x  54 y
Subject to: 3x  2 y  16
x y 8
x  0, y  0
1820 14
 Exercise 2
ABC mining company operates two mines for the
purpose of extracting gold and silver. The Saddle mine
costs $14,000/day to operate, and it yields 50 oz of gold
and 3000 oz of silver each day. The Horseshoe mine
costs $16,000/day to operate, and it yields 75 oz of gold
and 1000 oz of silver per day. Company management
set a target of at least 650 oz of gold and 18000 oz of
silver. If the company wants to minimize cost, formula
an LP model for this problem. Do not solve the LP
problem.
1820 15
 Graphical solution of LP
• If a linear programming problem has a
solution, then it must occur at a vertex, or
corner point, of the feasible set associated with
the problem.
• If the objective function is optimized at two
adjacent vertices of the feasible set, then it is
optimized at every point on the line segment
joining these vertices (hence infinitely many
solutions).
1820 16
 Existence of a Solution
Suppose we are given a linear programming problem
with a feasible set S and an objective function
P = ax + by.
a. If S is bounded, then P has both a maximum and minimum
value on S.
b. If S is unbounded and both a and b are nonnegative, then P
has a minimum value on S provided that the constraints
defining S include inequalities x  0 and y  0.
c. If S is the empty set, then there is no solution.

1820 17
 The Method of Corners
1. Graph the feasible set.
2. Find the coordinates of all corner points (vertices) of
the feasible set.
3. Evaluate the objective function at each corner point.
4. Find the maximum (minimum). If there is only one,
it is unique. If two adjacent vertices share this value,
there are infinitely many solutions given by the points
on the line segment connecting these vertices.

1820 18
Example 4
Maximize P = 4x + 5y
Subject to 3 x  5 y  20 Optimal solution (if it exists)
will occur at a corner point
x y 6
x  0, y  0 Check Vertices:

Feasible set – (0, 0) : P  4(0)  5(0)  0

candidates for (0, 4) : P  4(0)  5(4)  20
a solution (5,1) : P  4(5)  5(1)  25
(6, 0) : P  4(6)  5(0)  24

The maximum is 25 at
1820 (5, 1) 19
Ex 5. Minimize C = 10x + 11y
Subject to 20 x  10 y  300
15 x  15 y  300
10 x  20 y  250
x  0, y  0
Check Vertices:
(0,30) : C  330
Feasible set (10,10) : C  210
(15,5) : C  205
(25, 0) : C  250

The minimum is 205 at

(15, 5).
1820 20
Ex 6. Unbounded – No Solution
Maximize P  3 x  5 y
Subject to 3 x  y  1
x  2y  2
x  0, y  0

Unbounded
Feasible set

No Maximum

1820 21
Ex 7. Unfeasible Problem
Maximize P = 10x + 11y
Subject to 3 x  4 y  1
2x  y  4
x  0, y  0

No Feasible set – No
overlap

1820 22
 Exercise 2a:

Solve the LP problem:

M aximize P  12 x  10 y
Subject to 20 x  15 y  6000
10 x  15 y  4800
4x  6 y  0
x  0, y  0

Ans: Maximum is P = 3733.33 at x = 200, y = 133.33

1820 23
 Exercise 2b:

Refer to the LP problem in example 3. How many tables of

each type should be made each day to maximize profit?
Use graphical method to solve the LP problem.

Maximize P  50 x  54 y
Subject to 3 x  2 y  16
x y 8
x  0, y  0
Ans: To maximize profit, the company should produce 8
units of type B tables only.
1820 24
 Exercise 2c:

Refer to the LP problem in Exercise 2. How many days

should each mine be operated so that the cost can be
minimized? Use graphical method to solve the LP problem.

Minimize C  14000 x  16000 y

Subject to 2 x  3 y  26
3 x  y  18
x  0, y  0
Ans: To maximize cost, the Saddle mine should operate
for 4 days and Horseshoe mine for 6 days.
1820 25
“Develop a passion for learning.
If you do, you will never cease to
grow.”
ANTHONY J. D’ANGELO

1820 26