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 minimum 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
Determine the maximum value of $Z=11 x+7 y$ subject to the constraints:
$2 x+y \leq 6, x \leq 2, x \geq 0, y \geq 0$
$2 x+y \leq 6, x \leq 2, x \geq 0, y \geq 0$
Medium
View SolutionThe feasible region for a $LPP$ is shown in the figure. Find the maximum value of $Z=11x+7y$.
Easy
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 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:
The following graph represents a feasible region. The minimum value of $z = 5x + 4y$ is $\ldots \ldots$
Medium
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