Problem 3:

Two models P & Q of a product ean profits of ₹100 and ₹80 per piece.
Production times for P and Q for 5 hrs and 3 hrs. Total production time
available is 150 hrs. For a total batch size of 40, to maximise profit, no of units
to be produced? (GATE-2017 : 2 marks)

Solution:
Maximise Z
No of units of P be ‘x’
No of units of Q be ‘y’

Now,
Z = 100x + 80y,
150 >= 5x + 3y…….(1)
40 >= x + y…….(2)

At x = 0 In (1) & (2)

y = 50 & y = 40

At y = 0 In (1) & (2)

x = 30 & x = 40

Therefore the co-ordinates are,

(30,0), (40,0), (0,50), (0,40)

A(0,40), B(30,0) point C is

5x + 3y = 150
3x + 3y = 40*3
x = 15

Taking points on the boundary,

At (0,40), Z = ₹3200…….(3)
At (30,0), Z = ₹3500…….(4)

Since (4) > (3), To Maximise Profit no of units of P is 15

Problem 4:
Maximise Z = 15x + 20y subject to [ 12x + 4y >= 36, 12x – 6y <= 36, x,y>=0]
Above linear programming problem has (GATE-2016 : 2 marks)
a) Infeasible solution
b) Unbounded solution
c) Alternate solution
d) Degenerate solution

Solution:
Maximise Z = 15x + 20y
At x = 0, From the above two given equations y = 9 & y = -6
At y = 0, From the above two given equations x = 3 & x = 3

The co-ordinates are (0,9), (0,-6), (3,0), (3,0)

The below graph has an infinite value of x,y for maximum of Z.
The solution is unbounded Option (b)
Problem 5:
A manufacturer has two types of products 1 and 2 at production levels of
𝒙𝟏 , 𝒙𝟐 . Profit is to be given as 𝟐𝒙𝟏 + 𝟓𝒙𝟐 . Constraints are 𝒙𝟏 + 𝒙𝟐 ≤ 𝟒𝟎,
𝟑𝒙𝟏 + 𝒙𝟐 ≤ 𝟐𝟒, 𝒙𝟏 + 𝒙𝟐 ≤ 𝟏𝟎, 𝒙𝟏 , 𝒙𝟐 > 𝟎. Maximum profit attained by
taking the constraints into consideration.
a) 29
b) 38
c) 44
d) 75

Solution :
To find out the point on the lines at 𝑥1 = 0. On substituting the this point on the
above given equations we get co-ordinates
(0,40/3), (0,24), (0,10) respectively.

At 𝑥2 = 0, again substituting this value in

the above given three equations we get co-
ordinates (40,0), (8,0), (10,0) respectively.

Points A(0,10), B(8,0)

3𝑥1 + 𝑥2 = 24
𝑥1 + 𝑥2 = 10
𝑥1 = 7 => 𝑥2 = 3

Point C (7,3)

Maximise Z
At (0,10), Z = 50
At (8,0), Z = 16
At (7,3), Z = 29

Maximum profit attained when 𝑥1 = 0, 𝑥2 = 10

But since 𝑥1 > 0, 𝑥2 > 0, only possible solution is 𝑥1 = 7, 𝑥2 = 3

Maximum Profit is 29 Option a