Maximum value of $z = 3x + 4y$ subject to the constraints $x - y \leqslant -1$,$-x + y \leqslant 0$,and $x, y \geqslant 0$ is:

  • A
    $1$
  • B
    $4$
  • C
    $6$
  • D
    Does not exist

Explore More

Similar Questions

The feasible region for a $LPP$ is shown in the figure. Find the minimum value of $Z=11x+7y$.

The corner points of the bounded feasible region are $(0,1), (0,7), (2,7), (6,3), (6,0), (1,0)$. For the objective function $Z = 3x - y$:
$(i)$ At which point is $Z$ minimum?
$(ii)$ At which point is $Z$ maximum?
$(iii)$ The maximum value of $Z$ is $\ldots$
$(iv)$ The minimum value of $Z$ is $\ldots$

Difficult
View Solution

The corner points of the feasible region determined by the system of linear constraints are $(0,10), (5,5), (15,15), (5,25)$. Let $z = px + qy$ where $p, q > 0$. The condition on $p$ and $q$ so that the maximum of $z$ occurs at both the points $(15,15)$ and $(5,25)$ is . . . . . . .

The feasible region for a $LPP$ is shown in the following figure. Evaluate $Z = 4x + y$ at each of the corner points of this region. Find the minimum value of $Z$,if it exists.

The corner points of the feasible region determined by the system of linear constraints are $(2, 72)$,$(15, 20)$,and $(40, 15)$. Let $Z = 6x + 3y$ be the objective function. The minimum value of $Z$ occurs at:

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