Corner 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 $.....$
- A$p = 2q$
- B$p = \frac{q}{2}$
- C$p = 3q$
- D$p = q$
Explore More
Similar Questions
Maximum value of $z = 3x + 4y$ subject to the constraints $x - y \leqslant -1$,$-x + y \leqslant 0$,and $x, y \geqslant 0$ is:
The corner points of the feasible region are $A(3,3), B(20,3), C(20,10), D(18,12)$ and $E(12, 12)$. The maximum value of $Z=2x+3y$ is $.......$
Medium
View SolutionThe feasible region for an $LPP$ is shown in the figure. Let $z = 3x - 4y$ be the objective function. The minimum value of $Z$ is:
Medium
View SolutionSolve the Linear Programming Problem graphically:
Maximise $Z = 5x + 3y$
subject to the constraints:
$3x + 5y \leq 15$
$5x + 2y \leq 10$
$x \geq 0, y \geq 0$
Maximise $Z = 5x + 3y$
subject to the constraints:
$3x + 5y \leq 15$
$5x + 2y \leq 10$
$x \geq 0, y \geq 0$
Medium
View SolutionThe 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 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