[go: up one dir, main page]
Scribd
Upload
17 views20 pages

4 LP Graphical Method Maximization 1

Uploaded by

graezielann
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
17 views20 pages

4 LP Graphical Method Maximization 1

Uploaded by

graezielann
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 20

LESSON

#4
LEARNING
OUTC MES
Linear Programming
Solve linear program
problems in
Graphical Method
maximization using
graphical method.
Linear Programming
Graphical Method
(Maximization)
Definition of Terms:
Feasible Region
is a set of values for the decision variables that satisfies all of the constraints in an
optimization problem.
Optimal Solution
is a feasible solution where the objective function reaches its maximum or minimum
value of the objective function over the feasible region.
Vertices of the feasible region are corners or points where lines of feasible region meet.
Example:

Vertices
 Solving linear programming Problems using Graphical Method.
 Steps:
 1. Formulate the Linear Program model.
 2. Graph the constraints ( inequalities or equations) and shade the
area of the feasible solution.
 3. Solve and determine the coordinates of the vertices of the feasible
region.
 4. Substitute the coordinates of the vertices of the feasible region to
the objective function.
 5. Formulate the decision. If it is maximization choose the vertex that
will give the highest value (profit), whereas if it is minimization choose
the vertex that will give the lowest value ( cost).
Example: Let us make use of the Ideal Home problem that we had last
time.
Illustrative Example:
Ideal home Furniture Company manufactures two products: tables and chairs, which
must be processed through assembly and finishing departments. Assembly
department is
available for 60 hours in every production period while the finishing department is
available for 48 hours of work. Manufacturing one table requires 4 hours in the
assembly
and 2 hours in the finishing. Each chair requires 2 hours in the assembly and 4 hours
in the
finishing. The profit per table is P1,800 and P1,000 for each chair.
a. Formulate the LP model.
b. If the company wants to maximize total profit contribution, how many tables and
chairs should it manufacture?
c. What profit contribution can the company earn on these production quantities?
d. How many hours of production time will be scheduled for each operations.
e. What is the slack time for each operations?
Recall of Step 1 in Formulating the Linear Programming Model.
Table (x) Chair (y)) Time
Availabilit
y
Assembly 4x 2y 60 hours
Finishing 2x 4y 48 hours
Linear Program Model: Profit/unit P1,800 (x) P1,000(y)
Maximize: Z = P1,800x + P1,000y objective function
Subject to: 4x + 2y ≤ 60 hours 1st constraint (assembly)
2x + 4y ≤ 48 hours 2nd constraint (finishing)
x, y ≥ 0

Why is it that the relational symbol ≤ is used in the 1st and the 2nd
constraint?
Given the linear program model of Ideal Home problem below we can
proceed now to Step 2 of solving LP maximization using graphical
method.

Maximize: Z = P1,800x + P1,000y


Subject to: 4x + 2y ≤ 60 hours
2x + 4y ≤ 48 hours
x, y ≥ 0
Step 2: Graph the constraints and find the area of the feasible solution.:
Solve the intercepts of both constraints.
Costraints1: 4x + 2y ≤ 60 express to equation
4x + 2y = 60 solve for the x and y intercepts.
If x = 0, substitute 0 in place of x and simplify.
4(0) + 2y = 60
2y = 60 dividing both side by 2
2 2
y = 30 y-intercept (0, 30) X 0 15
If y = 0 substitute 0 in place of y and simplify
4x + 2y = 60 4x = 60 x = 15 y 30 (15, 0)0
x-intercept
4x + 2(0) = 60 4 4
 Constraint 2: 2x + 4y ≤ 48
 2x + 4y = 48
If x = 0, substitute 0 in place of x and simplify.
2(0) + 4y = 48
4y = 48 dividing both side by 4
4 4
y = 12 y-intercept (0, 12)
If y = 0 substitute 0 in place of y and simplify x 0 24
2x + 4y = 48 2x = 48 x = 24 y 12 (24,
x-intercept 0 0)
2x + 4(0) = 48 2 2
 Construct the rectangular coordinate system and locate the intercepts for both
constraints.
y-axis

 (0, 30) 30

25

4x + 2y = 60
x=0 20

15

 (0, 12) A
Area of the Feasible region
10
D (12,6)

y= 0
5 2x + 4y = 48
B x-axis
5 10 15 20 25 30
 Step 3
 Solve and determine the coordinates of the vertices of the feasible
region.
 Locate point C by using the lines of the 2 equations that forms point C.
 Using elimination method:
 4x + 2y = 60 Choose the variable that can be easily
eliminated
 2x + 4y =48 (-2) Eliminate x by multiplying equation 2 by (-2)
bring
 down equation 1 then add.
 E2: –4x – 8y = –96
 4x + 2y = 60
 –6y = –36 Divide both sides by 6
 –6 –6
 x=6
 Substitute 6 in place of y in any of the two equations:
 Use Equation 1.
 4x + 2(6) = 60
 4x + 12 = 60
 4x = 60 – 12
 4x = 48 dividing both sides by 4
 x = 12
 Therefore the coordinate of point C is (12, 6)
 Step 4:
 Substitute the coordinates of the vertices of the feasible region to the
objective function.
 Test Area ABCD
 Z = P1,800x + P1,000y
 Point A(0, 0) P1,800 (0) + P1,000 (0) = 0
 Point B (0,12) P1,800 (0) + P1,000 (12) = P12,000
 Point C (12, 6) P1,800 (12) + P1,000 (6) = P27,600
 Point D (15, 0) P1,800 (15) + P1,000 (0) = P27,000

 Step 5: Formulate the decision.


 b. The company will produce x = 12 tables and y = 6 chairs
 c. The company will earn P27,600
 d. Schedule time per production.
 Constraint 1: 4x + 2y 4(12) + 2(6) 48 + 12 = 60 For constraint 1
the company should have 60 hours which is the time available for
constraint 1
 Constraint 2:
 2x + 4y
 2(12) + 4(6)
 24 + 24 = 48 The company should have 48 hours for the
production
 of 12 tables and 6 chairs
 E. What is the slack time per operation?
 Note: Slack time is the unused time per operation.
 Formula: Slack time = Time available – time for the best combination
 that yield the highest profit.
 First operation or C1:
 Slack time = 60 hours – 60 hours used to produce 12 tables and 6
chairs
 Slack time = 0, which means no unused time. It uses all the available
 resources
 First operation or C2:
 Slack time = 48 hours – 48 hours used to produce 12 tables and 6
chairs
 Slack time = 0, which means no unused time. It uses all the available
 resources
 Assignment:
 Bataan Sporting Equipment Inc, makes two different types of baseball
gloves. A regular model and special model. The firm has 54,000
minutes of production time available in its cutting and sewing
department, 18,000 minutes available in its finishing department, and
6,000 minutes available in its packaging and shipping department.
The production time requirement and the profit contribution per glove
are given in the table below.
Department Regular Model (x) Special Model (y)
Cutting and Sewing 68 minutes 90 minutes
Finishing 30 minutes 20 minutes
Packaging and 7.5 minutes 15 minutes
Shipping
Assuming thatProfit
the per
company
Glove is interested
$50 in maximizing
$80 the total profit
contribution, answer the following questions on the next slide.
1. What is the linear programming model for this problem?
2. How many gloves of each model should the Bataan company
manufacture?
3. What is the total profit contribution Bataan Company earn with the
given production quantities?
4. How many minutes of production time will be scheduled in each
department?
5. What is the slack time in each department?
KEEP SAFE EVERYONE
END

You might also like