Let’s Pray

Let’s get Motivated!

“Guess
to
Price”
Let’s get Motivated!
Let’s get Motivated!
Let’s get Motivated!
Let’s get Motivated!
Let’s get Motivated!
Let’s get Motivated!
Let’s get Motivated!
Let’s get Motivated!
Let’s get Motivated!
Let’s get Motivated!
“TODAYS
TOPIC”
“Linear Programming
Using Graphical
Method”

Prepared by:
Ariel A. Valencia, LPT
Linear Programming
- A technique which helps to
find the optimum solution
for a given problem.
* optimum solution- best possible
outcome
OBJECTIVE FUNCTION
The direct function of form Z = ax + by,
where a and b are constant, which is
reduced or enlarged is called the objective
function. For example, if Z = 10x + 7y. The
variables x and y are called the decision
variable.
 CONSTRAINTS
The restrictions that are applied to a linear
inequality are called constraints.
Non-Negative Constraints: x > 0, y > 0 etc.
General Constraints: x + y > 40, 2x + 9y ≥ 40
etc.
 OPTIMIZATION
PROBLEM
A problem that seeks to maximization
or minimization of variables of linear
inequality problem is called
optimization problems.
 FEASIBLE REGION
A common region determined by all given
issues including the non-negative (x ≥ 0, y ≥
0) constrain is called the feasible region (or
solution area) of the problem. The region
other than the feasible region is known as
the infeasible region.
FEASIBLE SOLUTION
These points within or on the boundary
region represent feasible solutions of
the problem. Any point outside the
scenario is called an infeasible
solution.
 OPTIMAL SOLUTION
Any point in the emerging region that
provides the right amount (maximum or
minimum) of the objective function is
called the optimal solution.
 Usage
- Product mix
- Diet problem
- Portfolio selection problem
- Media selection
- Blending problem
- Transportation problem
- Travelling salesman problem
 Structure and
Formulation
1. Understand the problem/s
2. Convert to a Linear Programming
Problem.
 Formulation
A small business in the Philippines produces two popular native
delicacies, Bibingka and Puto, and wants to maximize its daily profit.
Each Bibingka requires 3 minutes in the cooking stage and 2 minutes
in the packaging stage, while each Puto requires 2 minutes in the
cooking stage and 4 minutes in the packaging stage. The cooking
equipment can operate for a maximum of 180 minutes per day, and the
packaging station has a limit of 160 minutes per day. The business
earns a profit of ₱15 per Bibingka and ₱10 per Puto. How many units
of each delicacy should be produced daily to maximize profit while
staying within the time constraints?
 Formulation
Maximum profit?

Constraint ----------- Production budget

Tabular Form:
Products Cooking stage Packaging stage Profit per unit
(minutes) (minutes) (Php)
A 3 2 15
B 2 4 10
Units of 180 160
Delicacy
 Table to equation
Products Cooking stage Packaging stage Profit per unit
(minutes) (minutes) (Php)
A 3 2 15
B 2 4 10
Units of Delicacy 180 160

Cooking Constraint:
3x+2y 180
Packaging Constraint:
2x+4y160

z = total profit
Z=15x+10y
Non-negativity Constraints:
x, y
Linear Programming
Problem
• Two Variables: (GRAPHICAL
METHOD) Cooking Constraint:
3x+2y 180
Packaging Constraint:
2x+4y160

z = total profit
Z=15x+10y
Non-negativity Constraints:
x, y
 GRAPHING
Non-negativity Constraints:
x, y
 Solving process
Cooking Constraint: z = total profit
3x+2y 180 Z=15x+10y
Packaging Constraint: Non-negativity
Constraints:
2x+4y160 x, y
INEQUALITIES CORRESPONDING CO-ORDINATES OF CO-ORDINATES OF
EQUATIONS X-INTERCEPT Y-INTERCEPT

3x+2y 180 3x+2y 180 (60,0) (0,90)

2x+4y160 2x+4y160 (80,0) (0,40)

 GRAPHICAL SOLUTION

CO-ORDINATES OF CO-ORDINATES OF
X-INTERCEPT Y-INTERCEPT

(60,0) (0,90)
(80,0) (0,40)
GRAPHICAL SOLUTION
WHAT IS OUR OPTIMAL SOLUTION?

• Feasible Region?
- Common region determined by
All the CONSTRAINTS
OPTIMAL SOLUTION
CORNER POINT METHOD

Z=15x+10y
CORNER CORRESPONDING
POINTS VALUE OF “Z”
O (0,0) Z=0(0)+0(0)=0

A (0,40) Z=15(0)+10(40)=400

B (50,15) Z=15(50)+10(15)=75
0+150=900
C (60,0) Z=15(60)+10(0)=900
 OPTIMAL SOLUTION
CORNER POINT METHOD

The maximum profit is ₱900, Z=15x+10y

CORNER CORRESPONDING
which occurs at two points: POINTS VALUE OF “Z”
(50,15) and (60,0). O (0,0) Z=0(0)+0(0)=0
Thus, the business can
A (0,40) Z=15(0)+10(40)=400
maximize profit by producing
either: B (50,15) Z=15(50)+10(15)=75
0+150=900
• 50 Bibingka and 15 Puto, or
C (60,0) Z=15(60)+10(0)=900
• 60 Bibingka and 0 Puto
 Practice Problem
A farmer in the Philippines owns a 5-hectare land and must decide
how much to allocate for planting Rice and Corn to maximize profit.
Each hectare of Rice requires 5,000 liters of water and 20 labor hours,
while each hectare of Corn requires 2,000 liters of water and 10 labor
hours. The total available water supply is 20,000 liters, and the total
labor available is 80 hours. Additionally, the total land area cannot
exceed 5 hectares. The profit per hectare is ₱30,000 for Rice and
₱20,000 for Corn. How many hectares of each crop should the farmer
plant to maximize profit while staying within the resource limits? Use
the graphical method to solve.
Solution

The maximum profit is

₱130,000, which occurs
when the farmer plants:
3 hectares of Rice and
2hectares of Corn