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$ so that the minimum value of $Z$ occurs at $(3,0)$ and $(1,1)$ is . . . . . . .
- A$p = 2q$
- B$p = \frac{q}{2}$
- C$p = 3q$
- D$p = q$
Explore More
Similar Questions
The optimal value of the objective function is attained at the points
Easy
View SolutionThe feasible solution for a $LPP$ is shown in the figure. Let $z=3x-4y$ be the objective function. The minimum value of $z$ occurs at:
Easy
View SolutionThe coordinates of the corner points of the bounded feasible region are $(0, 10)$, $(5, 5)$, $(15, 15)$, and $(0, 20)$. The minimum value of the objective function $z = 3x + 9y$ is . . . . . . .
MediumGUJCET 2026
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, 6)$,$(3, 3)$,$(9, 9)$,and $(0, 12)$. What is the maximum value of the objective function $z = 6x + 12y$?
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