$A$ factory manufactures two types of screws, $A$ and $B$. Each type of screw requires the use of two machines, an automatic and a hand-operated one. It takes $4 \, \text{minutes}$ on the automatic and $6 \, \text{minutes}$ on the hand-operated machine to manufacture a package of screws $A$, while it takes $6 \, \text{minutes}$ on the automatic and $3 \, \text{minutes}$ on the hand-operated machine to manufacture a package of screws $B$. Each machine is available for at most $4 \, \text{hours}$ on any day. The manufacturer can sell a package of screws $A$ at a profit of $Rs. \, 7$ and screws $B$ at a profit of $Rs. \, 10$. Assuming that he can sell all the screws he manufactures, how many packages of each type should the factory owner produce in a day in order to maximize his profit? Determine the maximum profit.

  • A
    $Rs. \, 410$
  • B
    $Rs. \, 400$
  • C
    $Rs. \, 280$
  • D
    $Rs. \, 350$

Explore More

Similar Questions

The maximum value of the objective function $z=4x+5y$ subject to the constraints $2x+3y \leq 12$,$2x+y \leq 8$ and $x \geq 0, y \geq 0$ is:

The maximum value of $z = 5x + 3y$ subject to constraints $3x + 5y \leq 15, x \geq 0, y \geq 0$ is :

The graph with the correct feasible region of the $L.P.P.$ for the constraints $2x + y \leqslant 10$,$y \leqslant x$,$y \leqslant 2$,$x, y \geqslant 0$ is $\ldots$

For the inequalities $x+y \leq 3$,$2x+5y \geq 10$,$x \geq 0$,$y \geq 0$,which of the following points lies in the feasible region?

The shaded area in the figure below is the solution set for a certain linear programming problem. Then the linear constraints are given by:

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo