Polytechnique University of the Philippines

Sto. Tomas Branch

LINEAR
PROGRAMMING
:
Graphical
Method
CHAPTER 2

Jhun Jhun M. Quiatchon, MBA

 LEARNING
• OBJECTIVES
At the end of this chapter, the student should
be able to:
1. Explain Linear Programming;
2. Identify the parts of Linear Programming;
3. State the assumptions in Linear
Programming
4. Determine the feasible region; and
5. Compute for the optimal Solution using the
graphical method
 • Linear Programming is a quantitative
technique use in properly allocating
Definition the resources of a business to
maximize its profit or minimize cost
Linear signifies the existence of a proportional
relationship between variables, which can be
either
• Directly Proportional Relationship
• Inversely Proportional Relationship
Programming refers to the use of a
mathematical model when developing an
equation to solve a problem

Note: The Term is not related to computer

programming
 1. Presence of objective function
Four
Propertie 2. Presence of constraints
s of
Linear
3. Availability of alternatives
Program
ming
Problems 4. Linear mathematical
relationship
1. Presence of objective function

MAXIMIZE MINIMZE
2. Presence of Constraints

• Plant Capacity
• Availability of materials
• Direct labor or
personnel
• Time
• Machine Capacity, etc.
3.
Availabilit
y of
alternativ
es
4. Linear
mathematic
al
relationship
Relationship of the variables is Example:
linear and can be expressed in
3A + 4B = 25
equalities or inequalities
5X + 6Y ≥ 69
Assumptions of
Linear
Programming

1. Certainty Assumptions
2. Proportionality Assumptions
3. Additivity Assumptions
4. Divisibility Assumptions
5. Non-negativity Assumptions
 Parts of Linear
Programming
1. Objective Function
Denotes the maximization of profit or
minimization of cost
2. Constraints
It is introduced by the words “subject to”
Two types 1. Explicit Constraints – Limitations that are
of expressed or stated in the problem
Example:
Constrain Machine Capacity is 450 units/ hour
Time allotted for production is 7.5 hours
ts
2. Implicit Constraints – implied limitations or
negativity assumptions
Example:
X units and Y units must be more than 0
Methods of Solving a Linear
Programming Problem

• Graphical Method
• Simplex Method
Graphical Method
• Utilizes two-
dimensional graph to
solve linear
programming
problems. Consist of
no more than two
variables
Steps Involved in Graphical Method
1. Use letters to represent the unknowns or variables in the problem.
2. If necessary, prepare a simple matrix to facilitate the formulation of
the constraints.
3. Formulate the objective function and the constraints in equalities and
inequalities.
4. Graph the constraints. If the lines intersect, solve for the coordinates
of the intersection point.
5. Determine the feasible region.
6. Determine the optimum solution.
7. Formulate the decision based on the highest profit or lowest cost.
 Maximization of Profit (Graphical
Method)
Jenny Furniture Shop produces two types of tables: an
elegant table and an ordinary table. The table, whether Required: Using the
elegant or ordinary, passes through two departments, graphical method of
namely, the assembly department and finishing linear programming,
department. Each elegant table requires 8 hours of determine the
assembly work and 4 hours of finishing task. Each ordinary number if units to be
table requires 6 hours in the assembly department and 2 produced to
hours in the finishing department. Every production period, maximized the
the shop has 480 hours of assembly time and 200 hours of
finishing time. The elegant table contributes Php700 to the
profits
company’s profit, while the ordinary table has a profit of
Php500.
Answer:
Step 1
Let x = number of elegant tables to be produced
y = number of ordinary tables to be produced

Step 2
Hours per Unit
x y Available Hours
Assembly department 8 6 480
Finishing department 4 2 200
Profit 700 500
Step 3
Max profit: P = Php700x + Php500y
Subject to: 8x + 6y ≤ 480
4x + 2y ≤ 200
x,y ≥ 0

Step 4 (First Constraint)

8x + 6y = 480
If x = 0, then y is 80, which If y = 0, then x is 60, which
is computed as follows: is computed as follows:
0 + 6y = 480 8x + 0 = 480
y = 80 x = 60
Step 4 (Second Constraint)
4x + 2y = 200
If x = 0, then y is 100, If y = 0, then x is 50, which
which is computed as is computed as follows:
follows: 4x + 0 = 200
0 + 2y = 200 x = 50
y = 100

In summary, the equation and the intercepts are:

For equation 8x + 6y = 480, the intercepts or vertices are (0,80) and (60,0).
For equation 4x +2y = 200, the intercepts or vertices are (0,100) and (50,0).
100 (0,100)

90
(0,80)
80 4x +2y = 200
70
60
50
40
30
8x +6y = 480
20
10 (50,0) (60,0)

0
0 10 20 30 40 50 60 70 80 90 100
The graph shows that the two lines Multiply the second equation by 2, then deduct
intersect. Hence, there is a need to the second equation from the first to eliminate
solve for the coordinates of the point x. Afterward, solve for the value of y as follows:
of intersection. By elimination 8x + 6y = 480
process, the coordinates are
determined as follows: 4x + 2y = 200
8x + 6y = 480 2y = 80
4x + 2y = 200 y = 40

Substitute the value of y, either to the first or second Thus the coordinates
equation, to solve for the value of x. Substituting the
value of y to the first equation, the value of x is of the point of
determined as follows: intersection are
8x + 6y = 480 (30,40).
8x + 6(40) = 480
X= 30
Step 5
Coordinates: (0,100), (0,80), (60,0), (50,0) and (30,40)
Constraints: 8x + 6y ≤ 480
4x + 2y ≤ 200

Coordinates (0,100) Coordinates (0,80)

First Constraint First Constraint Second Constraint
8x + 6y ≤ 480 8x + 6y ≤ 480 4x +2y ≤ 200
8(0) + 6(100) ≤ 480 8(0) + 6(80) ≤ 480 4(0)+2(80) ≤ 200
600 ≤ 480 480 ≤ 480 160 ≤ 200
Coordinates (60,0) Coordinates (50,0)
First Constraint Second Constraint First Constraint
8x + 6y ≤ 480 4x +2y ≤ 200 8x + 6y ≤ 480
8(60) + 6(0) ≤ 480 4(60) + 2(0) ≤ 200 8(50) + 6(0) ≤ 480
480 ≤ 480 240 ≤ 200 400 ≤ 480

Coordinates (50,0)
Second Constraint
First Constraint Second Constraint
4x +2y ≤ 200
8x + 6y ≤ 480 4x +2y ≤ 200
4(30) + 2(40) ≤ 200
8(50) + 6(0) ≤ 480 4(50) + 2(0) ≤ 200
200 ≤ 200
400 ≤ 480 200 ≤ 200
Feasible region is 100 (0,100
)

bounded by the 90
following vertices: 80
(0,80)

(0,80) 70
(50,0) 60
(30,0) 50
40
Shaded portion is 30
the feasible region. 20
10
(60,0)
0
0 10 20 30 40 50 60 70 80 90 100
Step 6
Vertices Max Profit = Php700x + Php500y
(0,80) = 700(0) + 500(80) = Php40,000.00
(50,0) = 700(50) + 500(0) = Php35,000.00
(30,40) = 700(30) + 500(40) = Php41,000.00

Step 7
The optimum solution, therefore, is to produce 30 units of elegant
tables and 40 units of ordinary tables to realize a profit Php41,000.00.
Minimization of Cost(Graphical
Method)
To operate the newly imported state of the art machinery
recently purchased by ABC Company, two types of fuels Required: Using the
are needed namely, Fuel A and Fuel B. The machine
specifications and requirements show that for every one graphical method,
hour of production time each gallon of Fuel A emits 6 determine the
units of chemical gas and generates a mechanical energy number of gallons of
equivalent to 8 horsepower. The costs Ph320. In similar Fuel A and Fuel B that
manner, each gallon of Fuel B emits 10 units of chemical are needed to operate
gas generates 8 horsepower of mechanical energy. This the machine at the
costs Php300. The maximum number of units of such type
of chemical gas allowed by the government to be emitted lowest possible cost
by such type of machinery is 30 units. The operating
activities of the company require at least 32 horsepower
of mechanical energy per hour.
Answer:
Step 1
Let x = number of gallons of Fuel A
y = number of gallons of Fuel B
Step 2
Units of
Mechanical
Chemical Gas Cost
Energy
Emitted
x 6 8 Php320.00
y 10 8 Php300.00
30 32
Step 3
Min cost: C = Php320x + Php300y
Subject to: 6x + 10y ≤ 30
8x + 8y ≥ 32
x,y ≥ 0

Step 4 (First Constraint)

6x + 10y = 30
If x = 0, then y is 3, which If y = 0, then x is 5, which
is computed as follows: is computed as follows:
0 + 10y = 30 6x + 0 = 30
y=3 x=5
Step 4 (Second Constraint)
8X + 8y = 32
If x = 0, then y is 4, which If y = 0, then x is 4, which
is computed as follows: is computed as follows:
0 + 8y = 32 8x + 0 = 32
y=4 x=4

In summary, the equation and the intercepts are:

For equation 6x + 10y = 30, the intercepts or vertices are (0,3) and (5,0).
For equation 8x +8y = 32, the intercepts or vertices are (0,4) and (4,0).
The two lines intersect; hence, there To eliminate x, multiply the first equation by 8
is a need to determine the and the second equation by 6. Then, deduct the
coordinates of the point of second equation as follows:
intersection. By elimination process, 48x + 80y = 240
the coordinates are determined as
follows: 48x + 48y = 192
8x + 6y = 480 32y = 48
4x + 2y = 200 y = 1.5

Substitute the value of y to the first equation to Thus the coordinates

determine the value of x as follows:
of the point of
6x + 10y = 30
6x + 10(1.5) = 30
intersection are
X= 2.5
(2.5,1.5).
Step 5
Coordinates: (0,4), (0,3), (2.5,1.5), (4,0) and (5,0)
Constraints: 6x + 10y ≤ 30
8x + 8y ≥ 32

Coordinates (0,4) Coordinates (0,3)

First Constraint First Constraint Second Constraint
6x + 10y ≤ 30 6x + 10y ≤ 30 8x +8y ≥ 32
6(0) + 10(4) ≤ 30 6(0) + 10(3) ≤ 30 8(0)+8(3) ≤ 32
40 ≤ 30 30 ≤ 30 24 ≥ 32
Coordinates (2.5,1.5) Coordinates (5,0)
First Constraint Second Constraint First Constraint
6x + 10y ≤ 30 8x +8y ≥ 32 6x + 10y ≤ 30
6(2.5) + 10(1.5) ≤ 30 8(2.5) +8(1.5) ≥ 32 6(5) + 10(0) ≤ 30
30 ≤ 30 32 ≥ 32 30 ≤ 30

Coordinates (4,0)
Second Constraint
First Constraint Second Constraint
8x +8y ≥ 32
6x + 10y ≤ 30 8x +8y ≥ 32
8(5) +8(0) ≥ 32
6(4) + 10(0) ≤ 30 8(4) +8(0) ≥ 32
40 ≥ 32
24 ≤ 30 32 ≥ 32
Feasible region is
bounded by the
following vertices:
(2.5,1.5)
(4,0)
(5,0)

Shaded portion is
the feasible region.
Step 6
Vertices Min Cost = Php320x + Php300y
(2.5,1.5) = 320(2.5) + 300(1.5) = Php1,250.00
(4,0) = 320(4) + 300(0) = Php1,280.00
(5,0) = 320(5) + 300(0) = Php1,600.00

Step 7
Since the objective function is to minimize the cost, the decision,
then, is to use 2.5 gallons of Fuel A and 1.5 gallons of Fuel B for the
optimum cost of Php1,250.00.
Special Cases in Linear
Programming

1. Infeasibility
2. Unboundedness
3. Redundancy
4. Alternate optimal solution
Infeasib
ility
Occurs when no
solution to a linear
programming that
could meet the
requirements of
constraints
Unbounde
dness
• Occurs when the
maximization problem
can have infinitely large
values without violating
the requirements of the
constraints
Redund
ancy
• Happens when there
is redundant
constraint, such as
requirement or
limitation that will
not affect the
feasible region
Alternate
Optimal
Solution
• Two or more potential
solution exist with the
same level of profit
regardless of selected
combination