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
Maximize $Z=3x+4y$,subject to the constraints: $x+y \leq 1, x \geq 0, y \geq 0$.
Medium
View SolutionFor a linear programming problem,the objective function is $Z = 10500x + 9000y$. If the corner points of the bounded feasible region are $(0,0)$,$(40,0)$,$(30,20)$,and $(0,50)$,then the maximum value of $Z$ is . . . . . . .
Show that the minimum of $Z$ occurs at more than two points.
Maximize $Z = -x + 2y$,subject to the constraints:
$x \geq 3, x + y \geq 5, x + 2y \geq 6, y \geq 0$
Maximize $Z = -x + 2y$,subject to the constraints:
$x \geq 3, x + y \geq 5, x + 2y \geq 6, y \geq 0$
Medium
View SolutionThe solution for minimizing the function $z = x + y$ under an $L$.$P$.$P$. with constraints $x + y \geqslant 2$,$x + 2y \leqslant 8$,$y \leqslant 3$,$x, y \geqslant 0$ is
The corner points of the feasible region determined by $A (20, 10)$,$B (18, 12)$,and $C (12, 12)$. The maximum value of the objective function $Z = 2x + 3y$ 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