The corner points of the feasible region determined by the system of linear constraints are $(0,10), (5,5), (15,15), (0,20)$. 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 $(0,20)$ is $\ldots \ldots$
- A$p = q$
- B$p = 2q$
- C$q = 2p$
- D$q = 3p$
Explore More
Similar Questions
Which of the following terms is not used in a linear programming problem?
The corner points of the feasible region determined by the system of linear constraints are $(0,10), (10,15), (15,25), (0,30)$. 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,25)$ and $(0,30)$ is . . . . . . .
The objective function of a Linear Programming Problem $(L.P.P.)$ defined over a convex set attains its optimum value at
If the vertices of a feasible region are $O(0,0), A(10,0), B(0,20), C(15,15)$,then the minimum value of the objective function $Z = 10x - 20y + 30$ is . . . . . . .
Maximize $Z=3x+4y$,subject to the constraints: $x+y \leq 1, x \geq 0, y \geq 0$.
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