The corner points of the feasible region determined by the system of linear constraints are $(0,10), (5,5), (15,15), (5,25)$. Let $z = px + qy$ where $p, q > 0$. The condition on $p$ and $q$ so that the maximum of $z$ occurs at both the points $(15,15)$ and $(5,25)$ is . . . . . . .
- A$p = q$
- B$q = 2p$
- C$p = 2q$
- D$q = 3p$
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
Consider a $LPP$ given by minimize $Z = 6x + 10y$. Subject to $x \geq 6, y \geq 2, 2x + y \geq 10, x \geq 0, y \geq 0$. Redundant constraints in this $LPP$ are $....$
Easy
View SolutionThe corner points of the feasible region are $(0,0), (16,0), (8,12), (0,20)$. The maximum and minimum values of $Z = 22x + 18y$ are $m$ and $n$ respectively,then $m + n = \dots$
Medium
View SolutionFor the $LP$ problem,maximize $z = 2x + 3y$,the coordinates of the corner points of the bounded feasible region are $A(3, 3), B(20, 3), C(20, 10), D(18, 12),$ and $E(12, 12)$. The maximum value of $z$ is $\dots$
Medium
View SolutionThe corner points of the feasible region are $(0,10), (5,5), (15,15), (0,20)$. The maximum value of $Z = 3x + 9y$ is . . . . . . .
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