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
The objective function of a Linear Programming Problem $(L.P.P.)$ defined over a convex set attains its optimum value at
Solve the Linear Programming Problem graphically:
Maximise $Z = 3x + 4y$
subject to the constraints: $x + y \leq 4, x \geq 0, y \geq 0.$
Maximise $Z = 3x + 4y$
subject to the constraints: $x + y \leq 4, x \geq 0, y \geq 0.$
Medium
View SolutionIn solving the $LP$ problem: "Minimize $z = 6x + 10y$ subject to $x \geq 6, y \geq 2, 2x + y \geq 10, x \geq 0, y \geq 0$." The redundant constraints are $....$
Easy
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$ such that the maximum of $Z$ occurs at both $(3,0)$ and $(1,1)$ is $.....$
Medium
View SolutionThe 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.
Easy
View SolutionVedclass 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