$A$ manufacturer makes two types of toys $A$ and $B$. Three machines are needed for this purpose and the time (in $minutes$) required for each toy on the machines is given below:
Types of ToysMachine-$I$Machine-$II$Machine-$III$
$A$$12$$18$$6$
$B$$6$$0$$9$

Each machine is available for a maximum of $6 \, hours$ $(360 \, minutes)$ per day. If the profit on each toy of type $A$ is $Rs. \, 7.50$ and that on each toy of type $B$ is $Rs. \, 5$,find the number of toys of each type that should be manufactured in a day to get maximum profit.

  • A
    $15 \, \text{toys of type } A, 30 \, \text{toys of type } B$
  • B
    $20 \, \text{toys of type } A, 20 \, \text{toys of type } B$
  • C
    $10 \, \text{toys of type } A, 40 \, \text{toys of type } B$
  • D
    $30 \, \text{toys of type } A, 15 \, \text{toys of type } B$

Explore More

Similar Questions

The maximum value of $Z = 4x + 5y$, subject to the constraints $3x + y \leq 15$, $3x + 4y \leq 24$, $x \geq 0$, $y \geq 0$ is

The graphical solution set of the system of inequations $x+y \geq 1$,$7x+9y \leq 63$,$y \leq 5$,$x \leq 6$,$x \geq 0$,$y \geq 0$ is represented by:

The cost function $Z$ is given by $Z = 4x + 6y$. It is to be minimized. The feasible region for this function $Z$ is the shaded region represented in the following figure. Then the minimum value of $Z$ is and occurs at the point:

The optimal solution of the $L$.$P$.$P$. Maximize $Z = 8x + 3y$ subject to the constraints $x + y \leq 3, 4x + y \leq 6, x \geq 0, y \geq 0$ is

If the feasible region is as shown in the figure,then the related inequalities are:

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