MBA , 52nd , 01 , MAT 501 Date:23.10.

21

Linear Programming Problem (LPP)

Linear Programming Problem: Linear
programming is a procedure for finding the
maximum or minimum values of a function in two
or more variables called objective function, subject
to given some conditions on the variables called
constraints followed by non-negativity restrictions.
Thus a Linear programming Problem has three
parts:
Part – 1: The Objective function
Part – 2: The Constraints
Part – 3: Non-negativity Restrictions

Prob –1: Star Insulating Company manufactures

two types of storm windows: Model H (the heavy
duty) and Model R (the regular). Model H sells for
$45 per window and costs $36 per window to make,
whereas Model R sells for $35 per window and cost
$27 per window to make. To make one Model H
window it requires 4 hours on Machine A and 3
hours on Machine, B. On the other hand to make
one Model R window, it takes 5 hours on Machine
A and 2 hours on Machine, B. Production
scheduling indicates that during the coming week
Machine A will be available for at most 30 hours
and Machine B for at most 19 hours. How many of
each window should the company make in the
coming week in order to maximize its profit? What
is this profit?
Solution:
Model Selling Cost Profit Machine
A B
H 45 36 9x 4x 3x
R 35 27 8y 5y 2y
At Most / maximum 30 19
Let model H should be made x units
and model R should be made y units.
Then the objective function
𝐙𝐌𝐚𝐱 = 𝟗𝐱 + 𝟖𝐲
Subject to (S / To)
𝟒𝒙 + 𝟓𝒚 ≤ 𝟑𝟎
𝟑𝒙 + 𝟐𝒚 ≤ 𝟏𝟗
𝒙 ,𝒚 ≥ 𝟎
Now
𝟒𝒙 + 𝟓𝒚 = 𝟑𝟎 𝟑𝒙 + 𝟐𝒚 = 𝟏𝟗
𝟒𝒙 𝟓𝒚 𝟑𝟎 𝟑𝒙 𝟐𝒚 𝟏𝟗
Or, 𝟑𝟎 + 𝟑𝟎 = 𝟑𝟎 Or, 𝟏𝟗 + 𝟏𝟗 = 𝟏𝟗
𝟐𝒙 𝒚
Or, 𝟏𝟓 + 𝟔 = 𝟏
𝒙 𝒚
Or, 𝟏𝟓 +𝟔=𝟏
𝒙 𝒚
𝟐 Or, 𝟏𝟗 + 𝟏𝟗 =𝟏
𝟑 𝟐

Solution Space

C
B

x
O A

Here the solution space is OABC. The

𝟏𝟗
vertices are O(0 , 0),A( , 𝟎) ,B(5 , 2) , C(0 , 6).
𝟑
At O(0 ,0) ; 𝒁 = 𝟗. 𝟎 + 𝟖. 𝟎 = 𝟎
𝟏𝟗 𝟏𝟗
At A( , 𝟎); 𝒁 = 𝟗. + 𝟖. 𝟎 = 𝟓𝟕 + 𝟎 = 𝟓𝟕
𝟑 𝟑
At B(5 , 2); 𝒁 = 𝟗. 𝟓 + 𝟖. 𝟐 = 𝟒𝟓 + 𝟏𝟔 = 𝟔𝟏
At C(0 , 6); 𝒁 = 𝟗. 𝟎 + 𝟖. 𝟔 = 𝟎 + 𝟒𝟖 = 𝟒𝟖
Hence the maximum profit is
$61.In this case , model H should be
made 5 units and model R should be
made 2 units.
Prob – 2: Safety lock Company makes two kinds of locks
: Model SS (the super safe) and Model S (the safe). Each
Model SS lock sells for $24 and costs $19 to make, while
each Model S lock sells for $18 and costs $15 to make.
Each of the locks must be processed on two machines.
Model SS requires 3 hours on Machine A and 2 hours on
B whereas Model S requires 7 hours on A, 1 hour on B.
During the coming week Machine A will be free for no
more than 42 hours and Machine B for no more than 17
hours. Determine the number of each kind of lock to be
made in the coming week for the company to maximum
profit. what will be the maximum profit.
Solution:
Model Selling Cost Profit Machine
A B
SS 24 19 5x 3x 2
S 18 15 3y 7y 1
No More Than 42 17
Let model SS should be made x units
and model S should be made y units.
Then the objective function
𝐙𝐌𝐚𝐱 = 𝟓𝐱 + 𝟑𝐲
Subject to (S / To)
𝟑𝒙 + 𝟕𝒚 ≤ 𝟒𝟐
𝟐𝒙 + 𝒚 ≤ 𝟏𝟕
𝒙 ,𝒚 ≥ 𝟎
Now
𝟑𝒙 + 𝟕𝒚 = 𝟒𝟐 𝟐𝒙 + 𝒚 = 𝟏𝟕
𝟑𝒙 𝟕𝒚 𝟒𝟐 𝟐𝒙 𝒚 𝟏𝟕
Or, + = Or, + =
𝟒𝟐 𝟒𝟐 𝟒𝟐 𝟏𝟕 𝟏𝟕 𝟏𝟕
𝒙 𝒚 𝒙 𝒚
Or, + =𝟏 Or, 𝟏𝟕 + =𝟏
𝟏𝟒 𝟔 𝟏𝟕
𝟐

Solution Space

C B

x
O
A
Here the solution space is OABC. The vertices are O(0 ,
𝟏𝟕
0),A( 𝟐 , 𝟎) ,B(7 , 3) , C(0 , 6).
At O(0 ,0) ; 𝒁 = 𝟓. 𝟎 + 𝟑. 𝟎 = 𝟎
𝟏𝟕 𝟏𝟕
At A( 𝟐 , 𝟎); 𝒁 = 𝟓. 𝟐 + 𝟑. 𝟎 = 𝟒𝟐. 𝟓
At B(7 , 3); 𝒁 = 𝟓. 𝟕 + 𝟑. 𝟑 = 𝟑𝟓 + 𝟗 = 𝟒𝟒
At C(0 , 6); 𝒁 = 𝟓. 𝟎 + 𝟑. 𝟔 = 𝟎 + 𝟏𝟖 = 𝟏𝟖
Hence the maximum profit is $44.In this case
, model SS should be made 7 units and model S
should be made 3 units.
Prob – 3: XYZ Steel Company manufactures two kinds of
wrought-iron rails: Model E (the elegant) and Model D (the
distinctive). Model E rails sell for $59 and cost $50 to make,
whereas Model D rails sell for $48 and cost $41 to make. To
make one Model E rail requires 2 hours on Machine A, 1 hour
on Machine B, and 4 hours on Machine C. On the other hand to
make one Model D rail Requires 1 hour on A, 2 hours on B, and
5 hours on C. Production scheduling indicates that during the
coming week Machine A will be available for at most 30 hours,
Machine B for at most 24 hours, and Machine C for at most 72
hours. Find the number of each kind of rail to be made in the
coming week in order for the company to maximize its profit.
What is this maximum profit?
Solution:
Model Selling Cost Profit Machine
A B C
E 59 50 9 2 1 4
D 48 41 7 1 2 5
At Most 30 24 72
Let model E should be made x units
and model D should be made y units.
Then the objective function
𝐙𝐌𝐚𝐱 = 𝟗𝐱 + 𝟕𝐲
Subject to (S / To)
𝟐𝒙 + 𝒚 ≤ 𝟑𝟎
𝒙 + 𝟐𝒚 ≤ 𝟐𝟒
4𝒙 + 𝟓𝒚 ≤ 𝟕𝟐
𝒙 ,𝒚 ≥ 𝟎
Now

𝟐𝒙 + 𝒚 = 𝟑𝟎 𝒙 + 𝟐𝒚 = 𝟐𝟒 𝟒𝒙 + 𝟓𝒚 = 𝟕𝟐
𝟐𝒙 𝒚 𝟑𝟎 𝒙 𝟐𝒚 𝟐𝟒 𝟒𝒙 𝟓𝒚 𝟕𝟐
Or, 𝟑𝟎 + 𝟑𝟎 = 𝟑𝟎 Or, 𝟐𝟒 + 𝟐𝟒 = 𝟐𝟒 Or, 𝟕𝟐 + 𝟕𝟐 = 𝟕𝟐
𝒙 𝒚 𝒙 𝒚 𝒙 𝒚
Or, 𝟏𝟓 + 𝟑𝟎 = 𝟏 Or, 𝟐𝟒 + 𝟏𝟐 = 𝟏 Or, 𝟏𝟖 + 𝟕𝟐 =𝟏
𝟓

Solution Space

D C

x
O A
Here the solution space is OABCD. The
vertices are O(0 , 0),A(𝟏𝟓, 𝟎) ,B(13 , 4) , C(8,8)
D(0, 12).
At O(0 ,0) ; 𝒁 = 𝟗. 𝟎 + 𝟕. 𝟎 = 𝟎
At A(𝟏𝟓, 𝟎); 𝒁 = 𝟗. 𝟏𝟓 + 𝟕. 𝟎 = 𝟏𝟑𝟓
At B(13 , 4); 𝒁 = 𝟗. 𝟏𝟑 + 𝟕. 𝟒 = 𝟏𝟒𝟓
At C(8 , 8); 𝒁 = 𝟗. 𝟖 + 𝟕. 𝟖 = 𝟕𝟐 + 𝟓𝟔 = 𝟏𝟐𝟖
At D(0 , 12); 𝒁 = 𝟗. 𝟎 + 𝟕. 𝟏𝟐 = 𝟎 + 𝟖𝟒 = 𝟖𝟒
Hence the maximum profit is
$145.In this case , model E should be
made 13 units and model D should be
made 4 units.
Prob – 4: A special food for athletes is to be
developed from two foods: Food X and Food Y. The
new food is to contain at least 16 milligrams of
Vitamin A, at least 20 milligrams of Vitamin B, and
at least 12 milligrams of Vitamin C. Each pound of
Food X costs $1.50 and contains 1 milligram of
Vitamin A, 5 milligrams of Vitamin B and 1
milligram of Vitamin C. On the other hand, each
pound of Food Y costs $2.50 and contains 2
milligrams of A, 1 Milligram of B and 1 milligram
of C. How many pounds of each food should be used
in the mixture in order to meet the preceding
requirements at a minimum cost? What is this
minimum cost?
Solution:
Food Item Cost Vitamin
A B C
X 1.5x 1 5 1
Y 2.5y 2 1 1
At Least / Minimum 16 20 12

Let food X should be used x pounds

and food Y should be used y pounds.
Then the objective function
𝐙𝐌𝐢𝐧 = 𝟏. 𝟓𝐱 + 𝟐. 𝟓𝐲
Subject to (S / To)
𝒙 + 𝟐𝒚 ≥ 𝟏𝟔
𝟓𝒙 + 𝒚 ≥ 𝟐𝟎
𝒙 + 𝒚 ≥ 𝟏𝟐
𝒙 ,𝒚 ≥ 𝟎
Now
𝒙 + 𝟐𝒚 = 𝟏𝟔 𝟓𝒙 + 𝒚 = 𝟐𝟎 𝒙 + 𝒚 = 𝟏𝟐
𝒙 𝟐𝒚 𝟏𝟔 𝟓𝒙 𝒚 𝟐𝟎 𝒙 𝒚 𝟏𝟐
Or, + = Or, + = Or, + =
𝟏𝟔 𝟏𝟔 𝟏𝟔 𝟐𝟎 𝟐𝟎 𝟐𝟎 𝟏𝟐 𝟏𝟐 𝟏𝟐
𝒙 𝒚 𝒙 𝒚 𝒙 𝒚
Or, + =𝟏 Or, + =𝟏 Or, + =𝟏
𝟏𝟔 𝟖 𝟒 𝟐𝟎 𝟏𝟐 𝟏𝟐
 y

Solution Space

B
X
O A

Here the solution space is the upper side of

ABCD. The vertices are A(16 , 0),B(𝟖, 𝟒) ,C(2 ,
10) ,D(0, 20).
At A(𝟏𝟔, 𝟎); 𝒁 = 𝟏. 𝟓 . 𝟏𝟔 + 𝟐. 𝟓. 𝟎 = 𝟐𝟒
At B(8 , 4); 𝒁 = 𝟏. 𝟓. 𝟖 + 𝟐. 𝟓. 𝟒 = 𝟐𝟐
At C(2 , 10); 𝒁 = 𝟏. 𝟓. 𝟐 + 𝟐. 𝟓. 𝟏𝟎 = 𝟐𝟖
At D(0 , 20); 𝒁 = 𝟏. 𝟓. 𝟎 + 𝟐. 𝟓. 𝟐𝟎 = 𝟓𝟎
Hence the minimum cost is $22.In this
case , food X should be used 8 pounds and
food Y should be used 4 pounds.