For a linear programming problem,the objective function is $Z = 3x + 9y$. The corner points of the feasible region are $(0, 10), (5, 5), (15, 15),$ and $(0, 20)$. The maximum value of $Z$ is . . . . . . .
- A$180$
- B$90$
- C$0$
- D$60$
Explore More
Similar Questions
Corner points of the feasible region for an $LPP$ are $(0,2), (3,0), (6,0), (6,8)$ and $(0,5)$. Let $Z = 4x + 6y$ be the objective function. The minimum value of $Z$ occurs at
Show that the minimum of $Z$ occurs at more than two points.
Maximize $Z = x + y$,subject to $x - y \leq -1$,$-x + y \leq 0$,$x, y \geq 0$.
Maximize $Z = x + y$,subject to $x - y \leq -1$,$-x + y \leq 0$,$x, y \geq 0$.
Medium
View SolutionThe shaded region in the given figure is a graph of $.....$
Medium
View SolutionSolve 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 Solution$A$ feasible solution to an $LP$ problem . . . . . . .
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