$A$ diet of a sick person must contain at least $4000$ units of vitamins,$50$ units of proteins,and $1400$ calories. Two foods $A$ and $B$ are available at a cost of ₹ $4$ and ₹ $3$ per unit respectively. If one unit of $A$ contains $200$ units of vitamins,$1$ unit of protein,and $40$ calories,while one unit of food $B$ contains $100$ units of vitamins,$2$ units of protein,and $40$ calories,formulate the problem so that the diet is the cheapest.

  • A
    $200x + 100y \geq 4000, x + 2y \geq 50, 40x + 40y \geq 1400, x \geq 0, y \geq 0, \text{Minimize } z = 4x + 3y$
  • B
    $400x + 200y \geq 100, x + 2y \geq 50, 40x + 40y \geq 1400, x \geq 0, y \geq 0, \text{Minimize } z = 4x + 3y$
  • C
    $100x + 200y \geq 4000, x + 2y \geq 50, 40x + 40y \geq 1400, x \geq 0, y \geq 0, \text{Minimize } z = 4x + 3y$
  • D
    None of the above

Explore More

Similar Questions

The shaded area in the figure given below is a solution set of a system of inequations. The minimum value of the objective function $Z = 3x + 5y$,subject to the linear constraints given by this system of inequations,is:

$A$ dietician wishes to mix together two kinds of food $X$ and $Y$ in such a way that the mixture contains at least $10$ units of vitamin $A$,$12$ units of vitamin $B$,and $8$ units of vitamin $C$. The vitamin contents of one $kg$ of food are given below:
Food Vitamin $A$ Vitamin $B$ Vitamin $C$
$X$ $1$ $2$ $3$
$Y$ $2$ $2$ $1$

One $kg$ of food $X$ costs $Rs. 16$ and one $kg$ of food $Y$ costs $Rs. 20$. Find the least cost of the mixture which will produce the required diet?

Difficult
View Solution

$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.

Difficult
View Solution

For the following shaded region,the linear constraints are:

The feasible region of the $L$.$P$.$P$. (Linear Programming Problem) to maximize $z = 70x + 50y$ subject to the constraints $8x + 5y \leq 60$,$4x + 5y \leq 40$ and $x \geq 0, y \geq 0$ is:

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