The corner points of the feasible region determined by a system of linear constraints are $(0, 3), (1, 1)$ and $(3, 0)$. If the objective function is $z = px + qy$ where $p, q > 0$, then the condition on $p$ and $q$ such that the minimum of $z$ occurs at both $(3, 0)$ and $(1, 1)$ is . . . . . . .
- A$p = 3q$
- B$3p = q$
- C$p = \frac{q}{2}$
- D$p = 2q$
Explore More
Similar Questions
The corner points of the feasible region determined by the system of linear constraints are $(0, 10)$, $(5, 5)$, $(15, 15)$, and $(0, 20)$. Let $z = px + qy$ where $p, q > 0$. The condition on $p$ and $q$ such that the maximum value of $z$ occurs at both points $(15, 15)$ and $(0, 20)$ is
DifficultKCET 2026
View SolutionFor a Linear Programming Problem $(LPP)$,if the objective function is $Z = 4x + 3y$ and the corner points of the bounded feasible region are $(0,0), (25,5), (16,16),$ and $(5,24)$,then the maximum value of $Z$ occurs at the point . . . . . . .
For 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 . . . . . . .
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 SolutionConsider 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 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