For the objective function $Z = 4x + y$ subject to the constraints $x + y \leq 50$,$3x + y \leq 90$,$x \geq 0$,$y \geq 0$,whose corner points of the feasible region are $(0,0)$,$(30,0)$,$(20,30)$,and $(0,50)$,the maximum value of $Z$ is . . . . . . .
- A$150$
- B$200$
- C$130$
- D$120$
Explore More
Similar Questions
Minimise $Z = 3x + 2y$ subject to the constraints:
$x + y \geqslant 8$ ... $(1)$
$3x + 5y \leqslant 15$ ... $(2)$
$x \geqslant 0, y \geqslant 0$ ... $(3)$
$x + y \geqslant 8$ ... $(1)$
$3x + 5y \leqslant 15$ ... $(2)$
$x \geqslant 0, y \geqslant 0$ ... $(3)$
Medium
View SolutionThe coordinates of the corner points of the bounded feasible region are $(0, 10)$, $(5, 5)$, $(15, 15)$, and $(0, 20)$. The minimum value of the objective function $z = 3x + 9y$ is . . . . . . .
MediumGUJCET 2026
View SolutionCorner points of the feasible region determined by the system of linear constraints are $(0,3)$,$(1,1)$ and $(3,0)$. Let $Z = px + qy$,where $p, q > 0$. The condition on $p$ and $q$ so that the minimum value of $Z$ occurs at $(3,0)$ and $(1,1)$ is . . . . . . .
Determine the maximum value of $Z=3x+4y$ if the feasible region (shaded) for a $LPP$ is shown in the adjacent figure.
Medium
View SolutionIf for a linear programming problem the feasible region is bounded,then the objective function has . . . . . . .
Vedclass Products
For Students
Vedclass Test Series
Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.
Start Free TrialFor Teachers
Exam Paper Generator
Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.
Try FreeFor Institutes
Online Exam Module
Live online exams with unlimited students, 360° analytics & white-label branding.
See Demo