0% found this document useful (0 votes)
10 views9 pages

Solution Assignment II

The document outlines a solution assignment involving linear programming problems with three distinct questions. Each question presents a maximization or minimization problem with constraints and corner points calculated to find optimal solutions. The final results indicate optimal values for variables and corresponding profits for each scenario.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
10 views9 pages

Solution Assignment II

The document outlines a solution assignment involving linear programming problems with three distinct questions. Each question presents a maximization or minimization problem with constraints and corner points calculated to find optimal solutions. The final results indicate optimal values for variables and corresponding profits for each scenario.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Solution Assignment II

 Min: 𝑍 = 5𝑥 + 4𝑦
 S.T
4𝑥 + 𝑦 ≥ 4
2𝑥 + 3𝑦 ≥ 90
𝑥 ≥ 0, 𝑦 ≥ 0
Solution:
The associated equations are

4𝑥 + 𝑦 = 4 2𝑥 + 3𝑦 = 90
𝑝𝑢𝑡 𝑥 = 0 ⇒ 𝑦 = 4 ⇒ 0,4 𝑖𝑠 𝑎 𝑝𝑜𝑖𝑛𝑡 𝑝𝑢𝑡 𝑥 = 0 ⇒ 𝑦 = 30
𝑝𝑢𝑡 𝑦 = 0 ⇒ 𝑥 = 1 ⇒ 1,0 𝑖𝑠 𝑎 𝑝𝑜𝑖𝑛𝑡 ⇒ 0,30 𝑖𝑠 𝑎 𝑝𝑜𝑖𝑛𝑡
𝑇𝑒𝑠𝑡 𝑝𝑜𝑖𝑛𝑡 = 0,0 𝑝𝑢𝑡 𝑦 = 0 ⇒ 𝑥 = 45
0 + 0 ≥ 4 𝑓𝑎𝑙𝑠𝑒 ⇒ 45,0 𝑖𝑠 𝑎 𝑝𝑜𝑖𝑛𝑡
𝑠𝑜𝑙𝑢𝑡𝑖𝑜𝑛 𝑖𝑠 𝑜𝑝𝑝𝑜𝑠𝑖𝑡𝑒 𝑡𝑜 𝑜𝑟𝑖𝑔𝑖𝑛 𝑇𝑒𝑠𝑡 𝑝𝑜𝑖𝑛𝑡 = 0,0
0 + 0 ≥ 90 𝑓𝑎𝑙𝑠𝑒
𝑠𝑜𝑙𝑢𝑡𝑖𝑜𝑛 𝑖𝑠 𝑜𝑝𝑝𝑜𝑠𝑖𝑡𝑒 𝑡𝑜 𝑜𝑟𝑖𝑔𝑖𝑛
 To find corner points we see that the solution is not
bounded, so we have only two corner points.
0,30 𝑎𝑛𝑑 45,0
Corner Point Z=5𝑥 + 4𝑦
(0,30) 5 × 0 + 4 × 30 = 120
(45,0) 5 × 45 + 4 × 0 = 225

Hence the optimal solution is 𝑥 = 0, 𝑦 = 30 and optimal


value is 𝑧 = 120
Q2
 Let 𝑥 denotes the quantity of pants and 𝑦 denotes the
quantity of jackets then according to the condition
Pants Jacket
Cotton 1×𝑥 1.5 × 𝑦 750
Polyster 2×𝑥 1×𝑦 1000

The profit on pant is 50 and jacket is 40. so total profit


will be
𝑍 = 50𝑥 + 40𝑦
Thus the problem is now
𝑀𝑎𝑥: 𝑍 = 50𝑥 + 40𝑦
S.T
𝑥 + 1.5𝑦 ≤ 750
2𝑥 + 𝑦 ≤ 1000
We use graphical method to solve this problem as we did
in previous question.
 From the graph we have four corner points as below
Corner points Z=𝟓𝟎𝒙 + 𝟒𝟎𝒚
(0,500) 50 × 0 + 40 × 500 = 20,000
(0,0) 50 × 0 + 40 × 0 = 0
(500,0) 50 × 500 + 4 × 0 = 25,000
(375,250) 50 × 375 + 40 × 250
= 28,750

Hence the optimal Profit is at 𝑥 = 375, 𝑦 = 250 and


profit is 𝑧 = 28,750
Q3:
Cake 1 Cake 2
Flour 0.2 kg 0.1 kg 5kg
Fat 0.025 kg 0.05 kg 1kg

Max: Z=𝑥 + 𝑦
S.T
0.2𝑥 + 0.1𝑦 ≤ 5
0.025𝑥 + 0.05𝑦 ≤ 1
Now solve as previous questions.

You might also like