100% found this document useful (2 votes)
697 views

Linear Programming Model LLP

The document describes four examples of linear programming problems involving the production of multiple products with constrained resources. In the first example, a company must determine how many of Models A and B TV sets to produce daily to maximize total profit given constraints on labor hours, machine hours, and marketing units. The optimal solution is to produce 12 units of Model A and 11 units of Model B for a daily profit of $6350.

Uploaded by

Akkama
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
100% found this document useful (2 votes)
697 views

Linear Programming Model LLP

The document describes four examples of linear programming problems involving the production of multiple products with constrained resources. In the first example, a company must determine how many of Models A and B TV sets to produce daily to maximize total profit given constraints on labor hours, machine hours, and marketing units. The optimal solution is to produce 12 units of Model A and 11 units of Model B for a daily profit of $6350.

Uploaded by

Akkama
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 10

Example 1: Consider two models of color TV sets; Model A and B, are produced by a company

to maximize profit. The profit realized is $300 from A and $250 from set B. The limitations are
i. Availability of only 40hrs of labor each day in the production department.
ii. A daily availability of only 45 hrs on machine time
iii. Ability to sale 12 set of model A.
How many sets of each model will be produced each day so that the total profit will be as large
as possible?
Resources used per unit
Constraints Model A Model B Maximum Available hrs.

(X1) (X2)
Labor hr. 2 1 40
Machine hr. 1 3 45
Marketing hr. 1 0 12
Profit $300 $250

Solution
1. Formulation of mathematical modeling of LPP
Max Z=300X1 +250X2
St:
2X1 +X2< 40
X1 +3X2< 45 LPP Model
X1 < 12
X1, X2 > 0
2. Convert constraints inequalities into equalities
2X1 +X2 = 40
X1 +3X2= 45
X1 = 12
3. Draw the graph by intercepts
2X1 +X2 = 40 ==> (0, 40) and (20, 0)
X1 +3X2= 45==> (0, 15) and (45, 0)
X1 = 12==> (12, 0)
X1, X2 = 0
X2

2X1 +X2 =
X1=0
40 X1=12

40
B

X1 +X2 = 45
15

Feasible C (12, 11)


Region X2=0
X1
D
A 12 20 45
4. Identify the feasible area of the solution which satisfies all constrains.
5. Identify the corner points in the feasible region
A (0, 0), B (0, 15), C (12, 11) and D (12, 0)
6. Identify the optimal point
7. Interpret the result
Corners Coordinates MaxZ=300 X1 +250X2
A (0, 0) $0
B (0, 15) $3750
C (12, 11) $6350
D (12, 0) $3600

Interpretation: 12 units of product A and 11 units of product B should be produced so that the
total profit will be $6350.

Example 2: Suppose that a machine shop has two different types of machines; machine A and
machine B, which can be used to make a single product .These machine vary in the amount of
product produced per hr., in the amount of labor used and in the cost of operation.
Assume that at least a certain amount of product must be produced and that we would like to
utilize at least the regular labor force. How much should we utilize each machine in order to
utilize total costs and still meets the requirement?
Resources used per unit
Constraints Machine A Machine B Maximum Available hrs.
(X1) (X2)
Product produced/hr 20 15 100
Labor/hr 2 3 15
Cost $25 $30

Solution_____________________________________________________________________
Resource used
Machine A (X1) Machine B(X2) Minimum required hours
_____________________________________________________________________
Product produced/hr 20 15 100
Labor/hr 2 3 15________
Operation Cost $25 $30___________________________
Min. Z =25 X 1 +30 X 2
St :
20 X 1 +15 X 2 ≥100 LPP Model A (0, 20/3)
2 X 1 +3 X 2 ≥15
X 1 , X 2 ≥0
Constraint equation:
20X1 +15X2=100 ==> (0, 20/3) and (5, 0)
B (2.5, 3.33)

2X1+3X2=15 ==> (0, 5) and (7.5, 0)


X1 =0

X1 X2> 0
Feasible Region
5

___________________________________________________________________
Corners Coordinates MinZ=25 X1 + 30X2
C (7.5, 0)

A (0, 20/3) 200


B (2.5, 3.33) 162.5
C (7.5, 0) 187.5
X2 =0

_______________________________________________________________
X1 =2.5
X1

X2=3.33 and
MinZ= 162.5

Example 3: A firm is engaged in producing two products A and B. Each unit of product A
requires 2Kg of raw material and 4 labor-hrs for processing. Where as each unit of product B
requires 3Kg of raw materials and 3hrs of labor. Every unit of product A requires 4 hrs for
packaging where as B needs 3.5hrs. Every week the firm has availability of 60Kg of raw
material, 96 labor-hours and 105 hrs in the packaging department. 1 unit of product A sold yields
$40 profit and 1 unit of B sold yields $35 profit.
Required:
a. Formulate this problem as a LPP
b. Find the optimal solution

Solution
__________________________________________________________________
Products Resource available
Resources A B per week
_____________________________________________________________________

Raw materials (Kg) 2 3 60


Labor (hr) 4 3 96
Packaging (hr) 4 3.5 105
Profit per unit $40 $35

Let X1 =The No of units of product A produced per week


X2 =The No of units of product B produced per week
a. LPP Model

Max. Z=40 X 1 +35 X 2


St :
2 X 1 +3 X 2 ≤60
4 X 1 +3 X 2 ≤96
4 X 1 +3 . 5 X 2 ≤105
X 1 , X 2 ≥0
(0
(0
(0
X2
2)
0)
0)
A (0, 0)

Labor: 4X1 +3X2 = 96


C (18,8)
Packaging: 4X1 +3.5X2 = 105

Raw material: 2X1 +3X2 = 60


FR
X1
D (24, 0) (26, 0) (30, 0)

 The packaging hr is redundant.

Corners Coordinates MinZ=40 X1 + 35X2


A (0, 0) 0
B (0, 20) 700
C (18, 8) 1000
D (24, 0) 960
X1 =18
X2=8 and
MinZ= 1000

Interpretation:
The company should produce and sale 18 units of product A and 8 units of product B per week
so as to get a maximum profit of 1000.
 By this production plan the entire raw material will be consumed.
 2X1 +3X2 <60
2(18) +3(8) =60
60=60==> N o idle or unused raw material
 4X1 +3X2 <96
4(18) +3(8) <96
96=96 ==>the entire labor hour will be consumed
 4X1 +3.5X2 <105
100<105==>There is to be idle or unused capacity of 5hrs in the packaging department.
Note: The packaging hour’s constraint does not form part of the boundary making the feasible
region. Thus, this constraint is of no consequence and is therefore, redundant. The inclusion or
exclusion of a redundant constraint does not affect the optimal solution of the problem.
Example 4: The information given below is for the products A and B.
_____________________________________________________________________
Machine hours per week Maximum available
Department Product A Product B per week
_____________________________________________________________________
Cutting 3 6 900
Assembly 1 1 200
Profit per unit $8 $16
_____________________________________________________________________
Assume that the company has a marketing constraint on selling products B and therefore it can
sale a maximum of 125units of this product.
Required:
a. Formulate the LPP of this problem
b. Find the optimal solution
Solution:
Let X1 =The No of units f product A produced per week
X2 =The No of units f product B produced per week
a. The LPP Model of the problem is:

Max. Z=8 X 1 +16 X 2


B (0, 125)

St :
(0,150)

(0, 200)

3 X 1 +6 X 2 ≤900
X2

X 1 +X 2 ≤200
A (0, 0)

X 2 ≤125
X 1 , X 2 ≥0

X1=0

C (50, 125) X2=125 Marketing equation


D (100,100)

Cutting: 3X1+6X2=900

FR X2=0

X1
(300,0)
Corners Coordinates MaxZ=8 X1 + 16X2
A (0, 0) 0
B (0, 125) 2000
C (50, 125) 2400
D (100, 100) 2400
E (200, 100) 1600

Interpretation:
Both C and D are optimal solutions. Any point on the line segment CD will also lead to the same
optimal solution.
==>Multiple optimal solutions provide more choices for management to reach their objectives.

Example 5: MaxZ=20X1+30X2
St:

X1
2X1+X2< 40
4X1+X2< 60 X2=0
X1 > 30
X1, X2 > 0
X1=30

Solution:

4X1+X2= 60

2X1+X2= 40

(15, 0) (20, 0) (30, 0)


Note:
-In the above graph, there is no common point in the shaded area.
-All constraints cannot be satisfied simultaneously and there is no feasible solution to the
X1=0

problem.
(0, 60)

(0, 40)

Example 6: ABC Gasoline Company has two refineries with different production capacities.
X2

Refinery A can produce 4,000gallons per day of SUPER UNLEADD GASOLINE, 2000 gallons
per day of REGULAR UNLEADED GASOLINE and 1000 gallons per day of LEADED
GASOLINE. On the other hand, refinery B can produce 1000 gallons per day of SUPER
UNLEADED, 3000 gallons per day of REGULAR UNLEADED and 4,000 gallons per day of
LEADED.

The company has made a contract with an automobile manufacturer to provide 24000 gasolines
of SUPER UNLEADED, 42000 gallons of REGULAR UNLEADED and 36000 gallons of
LEADED .The automobile manufacturer wants refinery A delivery in not more than 14 days.
The cost of running refinery A is $1500 per day and refinery B is $2400 per day.
Required:
a. Formulate this problem as a LPP
b. Determine the number of days the gasoline company should operate each refinery in order to
meet the terms of the above contract most economical. (i.e. At a minimum running cost)
c. Which grade of gasoline would be over produced?
Solution:
_____________________________________________________________________
Production per day Contract with an
Grade of (in gallons) automobile manufacturer
gasoline A B
_____________________________________________________________________

SUPER UNLEADED 4000 1000 24,000


REGULAR UNLEADED 2000 3000 42,000
LEADED 1000 4000 36,000
Running cost per day $1,500 $2,400
_____________________________________________________________________

 The automobile manufacturer wants refinery B delivery in not more than 14 days.
Let X1 =The No of days refinery A should work.
X2 =The No of days refinery B should work.
a. LPP of the problem

MinZ=1500X1+2400X2
St:
4000X1+1000X2>24000
2000X1+3000X2>42000
1000X1+2000X2> 36000
X1 < 14

X2< 14
X1, X2 > 0
==>T o simplify the problem divide by 1000 the constraints

MinZ=1500X1+2400X2
St:
4X1+1X2>24
2X1+3X2>42

A (2.5, 14)
X1+4X2 > 36

SUG: 4X1+X2 =24


(6, 0)

X1 < 14
RUG: 2X1+3X2 =42

X2< 14
FR
D (12, 6)

X1, X2 > 0
(14, 0)

B (14, 14)

Delivery time: X1=14


(21, 0)

LG: X1+4X2=36
(36, 0)

Delivery time: X2=14

Note: Point A, B, C, and D are solved by elimination-substitution method


_____________________________________________________________
Corners Coordinates MaxZ=1500X1 + 2400X2
A (2.5, 14) $37350
B (14, 14) 54600
C (14, 5.5) 34200
D (12, 6) 32400
E (3, 12) 33300
_________________________________________________________________
Interpretation:
The oil company should operate refinery A for 12 days and refinery B for 6 days at a minimum
operating cost of $32,400.
c. Is there any over production
SUG: 4000X1+1000X2>24000
4000(12) +1000(6)>24000
54000 > 24000
Therefore, 30,000 gallons over production

RUG: 2000X1+3000X2>42000
2000(12) +3000(6)>42000
42000 > 42000
Therefore, there is no over production of RUG

LG: 1000X1+4000X2>36000
1000(12) +1000(6)>36000
36000 > 36000
There fore, No over production of LG

You might also like