The corner points of the bounded feasible region are $(60,0), (120,0), (60,40), (40,20)$ and $(20,30)$. For the objective function $z=5x+10y$:
$(i)$ Maximum value of $z$.
$(ii)$ Minimum value of $z$.
$(iii)$ Maximum value of $z$ occurs at.
$(iv)$ Minimum value of $z$ occurs at.

  • A
    $700, 300, (60,40), (60,0)$
  • B
    $600, 400, (120,0), (40,20)$
  • C
    $600, 300, (120,0), (60,0)$
  • D
    $700, 600, (60,40), (120,0)$

Explore More

Similar Questions

The corner points of the feasible region determined by the system of linear inequalities are $(0,3), (1,1)$ and $(3,0)$. Let $Z = px + qy$ where $p, q > 0$. Find the condition on $p$ and $q$ such that the minimum of $Z$ occurs at both $(3,0)$ and $(1,1)$.

Let $x$ and $y$ be optimal solutions of a Linear Programming $(LP)$ problem. Then,which of the following is true?

For a linear programming problem,the objective function is $z = px + qy$,where $p, q > 0$. If at the corner points $(0, 10)$ and $(5, 5)$ the values of $z$ are $90$ and $60$ respectively,then the relation between $p$ and $q$ is . . . . . . .

$z = 30x - 30y + 1800$ is an objective function. The corner points of the feasible region are $(15, 0), (15, 15), (10, 20), (0, 20),$ and $(0, 15)$. $z$ has the minimum value at $\ldots$ point.

The following graph represents a feasible region. The minimum value of $z = 5x + 4y$ is $\ldots \ldots$

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