Q. A manufacturer has three machines I, II and III installed in his factory. Machines I and II are capable of being operated for atmost whereas machine III must be operated for atleast a day. She produces only two items and each requiring the use of all the three machines. The number of hours required for producing 1 unit of each of and on the three machines are given in the following table
Items Number of hours required on machines
I II III
M 1 2 1
N 2 1 1.25

She makes a profit of ₹ 600 and ₹ 400 on items and , respectively.
Then, to maximise the profit, number of units of item , the manufacturer has to produce, is

 110  213 Linear Programming Report Error

Solution:

Let and be the number of items and , respectively.
Total profit on the production
Mathematical formulation of the given problem is as follows
Maximise
Subject to the constraints are
...(i)
...(ii)
...(iii)
...(iv)
Let us draw the graph of constraints (i) to (iv). is the feasible region (shaded) as shown in figure determined by the constraints (i) to (iv). Observe that the feasible region is bounded, coordinates of the corner points and are and respectively.
image
Let us evaluate at these corner points.
Corner point
300
3600
Maximum
2400
1600

We see that the point is giving the maximum value of Z. Hence, the manufacturer has to produce 4 units of each item to get the maximum profit of .