The data in the given problem can be summarized as follows :
A box of type A screws requires 2 minutes on the threading machine and 3 minutes on the slotting machine.
A box of type B screws requires 8 minutes on the threading machine and 2 minutes on the slotting machine.
In a week ,each machine is available for 60hours(60$\times$ 60minutes=3600 minutes)
The company gets a profit of Rs100 per box on type A screws and Rs170 per box on type B screws.
Let $x$ be the no of screws required to be on a slotting machine and $y$ be the no of screws required to be on a threading machine.
These screws are brought to fulfill the maximum requirement of $x,y$ and maximize the profit.
The mathematic formulation of the above problem is as follows :
Subject to $3x+2y\leq 3600$ and $x+4y\leq 1800,x\geq 0,y\geq 0$