student PORTAL
Already have an account?
Group 4
student PORTAL
Remember Username
Cookies must be enabled in your browser
Log in using your account on:
Log In
Google
Forgotten your username or password?
IMAGINE YOURSELVES
AS MANAGERS
Pizza Burger
How many pizzas have to be produced and sold?
How many burgers have to be produced and sold?
LINEAR PROGRAMMING
Graphical
Method
LESSON OBJECTIVES:
At the end of this lesson, you will be able to:
Understand Linear Programming and its wide application
in real-world situations;
Design a model for linear programming;
Apply and resolve basic problems using linear
programming; and
Solve Linear Programming problems using Graphical
Method
student PORTAL
Dashboard
Dashboard
I. Introduction What is Linear Programming?
II. Linear Programming
III. Application &
Limitations Is a model that consist of linear relationships representing
IV. Techniques in
a firm’s decision(s), given on objective and resource
Linear Programming
constraints.
V. Problem Solving A linear relationship means the interdependence of one
variable (called the independent variable) and another
VI. Graphical Method
variable (called the dependent variable)
This means a change in the independent variable will
affect the dependent variable.
student PORTAL
Dashboard
Dashboard
I. Introduction What is Linear Programming?
II. Linear Programming
III. Application &
Limitations Help managers determine solutions (i.e., make decision)
IV. Techniques in for problems to achieve some objective in which there
Linear Programming
are restrictions, such as limited resources or a recipe or
V. Problem Solving perhaps production guidelines.
VI. Graphical Method
student PORTAL
Dashboard
Dashboard
Application & Limitation of Linear Programming
I. Introduction
II. Linear Programming
III. Application & Application Limitations
Limitations
IV. Techniques in
High reliance on the linear
Linear Programming Production of goods
relationship of the variable.
which require similar raw
V. Problem Solving Does not consider other
materials
unknown variables and
VI. Graphical Method Sell now or process further contingencies such as
“Which to produce; how losses, shrinkages and wastes
many to produce” Does not consider increases
decision-making and decreases of demand.
OBSERVATION: In the given activity,
What was our primary objective?
What were the resources?
What were the constraints?
What was our decision? How many pizza and burger do
we need to sell?
In our every day lives, what are the common decisions we
make where our resources are only limited?
OBSERVATION: In the given activity,
What were our independent variables?
Answer: The number of unit requirements per pizza
and burger
What were our dependent variables?
Answer: The number of pizza and burger produced
TECHNIQUES IN LINEAR
PROGRAMMING
student PORTAL
Dashboard
Techniques in Linear Programming
I. Introduction
II. Linear Programming
STEP 1: Define the decision variables
III. Application &
Limitations
How many pizza to produce?
IV. Techniques in
Linear Programming
STEP 2: Define the objective function
V. Problem Solving
Maximize profit
VI. Graphical Method
STEP 3: Define the constraints
The resources (dough, meat, veggies and cheese)
available
student PORTAL
Dashboard
Step 1: Defining the decision variables
I. Introduction
II. Linear Programming
Decion variables are mathematical symbols that
III. Application &
Limitations
represent levels of activity
IV. Techniques in
Linear Programming
The quantities to be produced can be represented
symbolically as:
V. Problem Solving
VI. Graphical Method
x = the number of pizza to produce and sell
y = the number of burgers to produce and sell
student PORTAL
Dashboard
Step 2: Defining the objective function
I. Introduction
II. Linear Programming
Objective function is a linear mathematical
III. Application &
Limitations
relationship that describes the objective of the firm
in terms of the decision variables.
IV. Techniques in
Linear Programming
The objective function always consists of either
maximizing or minimizing some value (e.g.,
V. Problem Solving
VI. Graphical Method maximize the profit or minimize the cost of
production).
student PORTAL
Dashboard
Step 2: Defining the objective function
I. Introduction
II. Linear Programming
In the activity, to derive with the objective function, we
must first calculate the profit per pizza and per burger.
III. Application &
Limitations
Thus,
IV. Techniques in
Linear Programming
V. Problem Solving
VI. Graphical Method
Each pizza is sold at ₱100.00, thus profit per unit of pizza
produced and sold would be ₱25.00
student PORTAL
Dashboard
Step 2: Defining the objective function
I. Introduction
II. Linear Programming Meanwhile, the cost per burger is computed as follows:
III. Application &
Limitations
IV. Techniques in
Linear Programming
V. Problem Solving
VI. Graphical Method
Each burger is sold at ₱75.00, thus the profit per burger is
₱21.00
student PORTAL
Dashboard
Step 2: Defining the objective function
I. Introduction
II. Linear Programming
With the given variables of:
x = the number of pizza to produce and sell
III. Application &
Limitations
IV. Techniques in
y = the number of burgers to produce and sell
Linear Programming
V. Problem Solving
Our objective function is represented as follows:
VI. Graphical Method
z = 25x + 21y
student PORTAL
Dashboard
Step 2: Defining the objective function
I. Introduction
II. Linear Programming
Meanwhile, the cost per burger is computed as follows:
III. Application &
Limitations
IV. Techniques in
Linear Programming
V. Problem Solving
VI. Graphical Method
Each burger is sold at ₱75.00, thus the profit per burger is
₱21.00
student PORTAL
Dashboard
Step 3: Define the constraints
I. Introduction
II. Linear Programming
Constraints are the restrictions or limitations in
III. Application &
Limitations achieving our objective, that is to maximize profit
IV. Techniques in
and minimize costs.
Linear Programming
V. Problem Solving
In the activity, four resources are used for
production-the dough, meat, veggies and cheese
VI. Graphical Method
all of which are limited.
student PORTAL
Dashboard
Step 3: Define the constraints
I. Introduction
II. Linear Programming
Production of pizza and burger requires all four
III. Application &
Limitations
resources.
IV. Techniques in
Linear Programming
V. Problem Solving
VI. Graphical Method
student PORTAL
Dashboard
Step 3: Define the constraints
I. Introduction
II. Linear Programming
How many resources do we have?
III. Application &
Limitations
IV. Techniques in Ingredients # of Units Available
Linear Programming
V. Problem Solving
Dough 23 pieces
VI. Graphic Method
Meat 30 pieces
Veggies 25 pieces
Cheese 41 pieces
student PORTAL
Dashboard
Step 3: Define the constraints
I. Introduction
II. Linear Programming
Each resource is limited, and we have to utilize most of
III. Application &
Limitations
them to maximize our profit.
This can be represented as follows:
IV. Techniques in
Linear Programming For the DOUGH :
The total available
V. Problem Solving Each pizza 2x + 1y ≤ 23 dough which will be
requires 2 dough shared by the
VI. Graphic Method production of pizza
The allocation of all and burger.
Each burger
requires 1 dough dough may be equal
or lesser than the total
available dough, but
not more than.
student PORTAL
Dashboard
Step 3: Define the constraints
I. Introduction
II. Linear Programming
For the MEAT:
III. Application &
Limitations 3x + 1y ≤ 30
IV. Techniques in
Linear Programming For the VEGGIES:
V. Problem Solving 1x + 2y ≤ 25
VI. Graphical Method For the CHEESE:
2x + 3y ≤ 41
student PORTAL
Dashboard
Step 3: Define the constraints
I. Introduction
II. Linear Programming
Final Restriction
The number of pizza (x) and burger (y) sold must be
III. Application &
Limitations
IV. Techniques in
equal to zero or any positive number because it is
Linear Programming impossible to produce negative items.
V. Problem Solving
These restrictions are referred to as non-negativity
contraints and are expressed mathematically as:
VI. Graphical Method
x ≥ 0, y ≥ 0
student PORTAL
Dashboard
I. Introduction
PROBLEM
SOLVING
II. Linear Programming
III. Application &
Limitations
IV. Techniques in
Linear Programming
V. Problem Solving
VI. Graphical Method
GRAPHICAL METHOD:
MAXIMIZATION AND
MINIMIZATION OF
PROFITS
student PORTAL
Dashboard
I. Introduction Max 2X + 5Y 2X + 5Y - Objective Function
II. Linear Programming
III. Application &
X, Y - Decision Variables
Limitations
X + 2Y ≤ 16
IV. Techniques in
Linear Programming
Constraints
V. Problem Solving
5X + 3Y ≤ 45
VI. Graphical Method
X, Y ≥ 0
Non-negativity constraints
student PORTAL
Dashboard
I. Introduction
II. Linear Programming
Max 2X + 5Y
IF X = 0
III. Application &
Limitations
IV. Techniques in
Linear Programming
V. Problem Solving
X + 2Y ≤ 16 Y=0
5X + 3Y ≤ 45
VI. Graphical Method
X, Y ≥ 0
student PORTAL
Dashboard
I. Introduction
II. Linear Programming
Max 2X + 5Y
III. Application &
Limitations
IV. Techniques in
Linear Programming
V. Problem Solving
X + 2Y ≤ 16
5X + 3Y ≤ 45
VI. Graphical Method
X, Y ≥ 0
student PORTAL
Dashboard
I. Introduction
II. Linear Programming
III. Application &
Limitations
IV. Techniques in
Linear Programming
V. Problem Solving
VI. Graphical Method
student PORTAL
Dashboard
C1 5
I. Introduction
II. Linear Programming
C2
III. Application &
Limitations
IV. Techniques in
Linear Programming
V. Problem Solving
VI. Graphical Method
student PORTAL
Dashboard
Optimal
I. Introduction
Solution
II. Linear Programming
X=0, Y=8
III. Application &
Limitations
IV. Techniques in
Linear Programming
V. Problem Solving
VI. Graphical Method
student PORTAL
Dashboard
I. Introduction
II. Linear Programming
III. Application &
Limitations
IV. Techniques in
Linear Programming
V. Problem Solving
VI. Graphical Method
If X = 0
Y=0
student PORTAL
Dashboard
I. Introduction
II. Linear Programming
III. Application &
Limitations
IV. Techniques in Note: The last point
Linear Programming
the imaginary line
touches going down
V. Problem Solving
(if it is minimization) is
VI. Graphical Method
the optimal solution
student PORTAL
Dashboard
I. Introduction
II. Linear Programming
III. Application &
Limitations
IV. Techniques in
Linear Programming
V. Problem Solving
VI. Graphical Method
student PORTAL
Dashboard
I. Introduction
II. Linear Programming
III. Application &
Limitations
IV. Techniques in
Linear Programming
V. Problem Solving
VI. Graphical Method
student PORTAL
Dashboard
I. Introduction
PROBLEM
SOLVING
II. Linear Programming
III. Application &
Limitations
IV. Techniques in
Linear Programming
V. Problem Solving
VI. Graphical Method
student PORTAL
Dashboard
I. Introduction
The complete linear programming model for this
problem can now be summarized as follows:
II. Linear Programming
III. Application &
Limitations Objective Function:
IV. Techniques in
Maximize z = 25x + 21y
Linear Programming
Subject To (Constraints):
V. Problem Solving
(Dough) 2x + 1y≤23 (Veggies) 1x + 2y≤25
VI. Graphical Method (Meat) 3x + 1y≤30 (Cheese) 2x +3y≤41
Final Restriction
x ≥ 0, y ≥ 0
student PORTAL
Dashboard
Solutions: Hypothetical Values
I. Introduction
II. Linear Programming Let us say, the value of x = 5 and y = 7, thus using the
dough
III. Application &
Limitations
IV. Techniques in Constraint:
Linear Programming While, it is true that x = 5 and y = 7
could be the solution to the
(Dough)
V. Problem Solving
problem, still it will not achieve our
2x + 1y ≤ 23
objective to maximize profit since
VI. Graphical Method 2(5) + 1(7) ≤23
there are still 6 dough remaining.
10 + 7≤23
17≤23
student PORTAL
Dashboard
Solutions: Hypothetical Values
I. Introduction
II. Linear Programming Let us say, the value of x = 8 and y = 11, thus using the
dough
III. Application &
Limitations
IV. Techniques in Constraint:
Linear Programming The values we assigned are false
(Dough) because the total number of dough
V. Problem Solving
2x + 1y≤23 that should be used must not
VI. Graphical Method 2(8) + 1(11) ≤23 exceed the total number of dough
16 + 11 ≤ 23 available.
27≤23
student PORTAL
Dashboard
Solutions: Find Intercepts
I. Introduction
II. Linear Programming
Convert each inequality to an equality to get the boundary
lines and find intercepts:
III. Application &
→
Limitations
1. 2x + y = 23 y = 23 - 2x
IV. Techniques in
Linear Programming x-intercept (y = 0): 2x = 23 → x = 11.5
y-intercept (x = 0): y = 23
V. Problem Solving
2. 3x + y = 30→ y = 30 - 3х
VI. Graphical Method
X-intercept: 3x = 30 → x = 10
y-intercept: y = 30
student PORTAL
Dashboard
Solutions: Find Intercepts
I. Introduction
→
II. Linear Programming
3. x + 2y = 25 y = (25 - x)/2
III. Application &
x-intercept: x = 25
→
Limitations
y-intercept: 2y = 25 y = 12.5
IV. Techniques in
Linear Programming
4. 2x + 3y =41 → y = (41 - 2x)/3
V. Problem Solving x-intercept: 2x = 41 → x = 20.5
VI. Graphical Method
y-intercept: 3y = 41 → у = 13.66
student PORTAL
Dashboard
I. Introduction
II. Linear Programming
III. Application & Points x y
Limitations
IV. Techniques in A 0 0
Linear Programming
B 10 0
V. Problem Solving
C 0 12
VI. Graphical Method
D 7 9
student PORTAL
Dashboard
Solutions: Corner Points
I. Introduction
II. Linear Programming Find intersections of boundary lines (solve pairwise)
III. Application &
Limitations A. Intersection of Dough and Meat:
IV. Techniques in
Linear Programming (Dough) (Meat)
2x + 1y=23 3x + 1y =30
V. Problem Solving y=-2x + 23 y=-3x + 30
VI. Graphical Method Solve for x: Solve for y:
-2x + 23 = -3x + 30 2x + 1y =23 y =23-14
-2x + 3x=-23 + 30 2(7) + y= 23 y=9
x =7 14+y =23
student PORTAL
Dashboard
Solutions: Corner Points
I. Introduction
II. Linear Programming B. Intersection of Veggies and Cheese
III. Application & Veggies: 1x + 2y ≤ 25 ( x=-2y +25)
Limitations
Cheese: 2x + 3y ≤41 (x=- 3/2y+41/2)
IV. Techniques in
Linear Programming
Solve for x:
V. Problem Solving -2y+25=-3y/2 +41/2 Solve for y:
2(-2y +25= -3y/2+41/2)2 1x+2y=25
VI. Graphical Method -4y+50=-3y +41 1x+2(9)=25
-4y + 3y = - 50 +41 x=25-18
-y =-9 or y=9 x=7
student PORTAL
Dashboard
I. Introduction
II. Linear Programming
To determine whether the values of x and y are correct, we will
test the values with the constraints equations:
III. Application &
Limitations
(Dough) 2x + 1y≤23
IV. Techniques in
Linear Programming (Meat) 3x + 1y≤30
(Veggies) 1x + 2y ≤25
V. Problem Solving
(Cheese) 2x +3y<41
Final Restriction x ≥ 0, y≥ 0
VI. Graphical Method
The above are the constraint equations.
student PORTAL
Dashboard
Let's try each constraint.
I. Introduction
II. Linear Programming (Dough) (Meat)
III. Application &
2x + 1y≤ 23 3x + 1y≤30
Limitations
2(7) + 1(9) ≤23 3(7) +1(9) ≤30
IV. Techniques in 14 + 9 ≤ 23 21 +9 ≤30
Linear Programming
TRUE TRUE
V. Problem Solving
(Veggies) (Cheese)
VI. Graphical Method 1x + 2y≤25 2x +3y<41
1(7) + 2(9) ≤ 25 2(7) +3(9) <41
7 + 18 ≤ 25 14+ 27≤41
TRUE TRUE
student PORTAL
Dashboard
I. Introduction It is now time to compute the maximum profit:
II. Linear Programming Objective Function:
Maximize z = 25x + 21y
III. Application &
Limitations
Points x y Total Profit
IV. Techniques in
Linear Programming
A 0 0 25(0) + 21(0)= 0
V. Problem Solving
B 10 0 25(10) + 21(0) = 250
VI. Graphical Method
C 0 12.5 25(0) + 21(12.5) = 262.5
D 7 9 25(7) + 21(9)= 364
student PORTAL
Dashboard
I. Introduction Final Thoughts:
II. Linear Programming
Linear programming can be very useful in a lot of
ways.
III. Application &
Limitations
IV. Techniques in It can also be resolved using a lot of methods such
Linear Programming
as graphical and simplex methods.
V. Problem Solving
But this is a purpose , we only discuss the graphical
VI. Graphical Method method which is useful especially in our profession,
Accountancy.