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:

  • A
    $260, (20, 30)$
  • B
    $240, (0, 40)$
  • C
    $100, (25, 0)$
  • D
    $254, (14, 33)$

Explore More

Similar Questions

The correct constraints for the given feasible region are:

The minimum value of $z = 3x + 5y$, subject to constraints $x \leq 80$, $y \geq 60$, $x + y \leq 200$ and $x, y \geq 0$ occurs at the point:

The graphical solution set for the system of inequations $x-2y \leq 2$,$5x+2y \geq 10$,$4x+5y \leq 20$,$x \geq 0$,$y \geq 0$ is given by

The minimum value of the objective function $Z = 5x + 8y$,subject to the constraints $x + y \geq 5$,$x \leq 4$,$y \leq 2$,$x \geq 0$,and $y \geq 0$,occurs at the point:

$A$ cottage industry manufactures pedestal lamps and wooden shades,each requiring the use of a grinding/cutting machine and a sprayer. It takes $2 \text{ hours}$ on the grinding/cutting machine and $3 \text{ hours}$ on the sprayer to manufacture a pedestal lamp. It takes $1 \text{ hour}$ on the grinding/cutting machine and $2 \text{ hours}$ on the sprayer to manufacture a shade. On any day,the sprayer is available for at most $20 \text{ hours}$ and the grinding/cutting machine for at most $12 \text{ hours}$. The profit from the sale of a lamp is $Rs. 5$ and that from a shade is $Rs. 3$. Assuming that the manufacturer can sell all the lamps and shades that he produces,how should he schedule his daily production in order to maximise his profit?

Difficult
View Solution

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