Q. A factory manufactures two types of screws, and B. Each type of screw requires the use of two machines, an automatic and a hand operated. It takes on the automatic and on hand operated machines to get of screws , while it takes on automatic and on the hand operated machines to manufacture a package to screws . Each machine is available for atmost on any day. The manufacturer can sell a package of screws at a profit of and screws at a profit of . Assuming that he can sell all the screws he manufactures, The maximum profit is

 191  167 Linear Programming Report Error

Solution:

Let the manufacturer produces package of screws and package of screws . We construct the following table
Item Number of packages Time on automatic machine (in min) Time on hand machine (in min) Prófit (in ₹)
A x 4x 6x 7x
B y 6y 3 y 10 y
Total x+y 4x + 6y 6x + 3y 17 x + 10 y
Availability

The profit on a package of screws is and on the package of screws is .
Our problem is to maximise ...(i)
Subject to constraints are
...(ii)
...(iii)
and ...(iv)
Firstly, draw the graph of the line .
x 0 60
y 40 0

image
Putting in the inequality , we have


So, the half plane is towards the origin.
Secondary, draw the graph of the line
x 40 0
y 0 80

Putting in the inequality , we have

(which is lrue)
So, the half plane is towards the origin. Since,
So, the feasible region lies in the first quadrant.
On solving equations and , we get .
Feasible region is .
The corner points of the feasible region are ,
and . The values of at these points are as follows
Corner point
0
280
Maximum
400

The maximum value of is at .
Thus, the factory should produce 30 packages of screws and 20
packages of screws lo yel the maximum profil of .