The corner points of the feasible region determined by the system of linear inequalities $2x + y \leq 10$,$x + 3y \leq 15$,$x, y \geq 0$ are $(0,0)$,$(5,0)$,$(3,4)$,and $(0,5)$. Let $Z = qx + py$ where $p, q > 0$. The condition on $p$ and $q$ such that the maximum of $Z$ occurs at both $(3,4)$ and $(0,5)$ is:
- A$p = 3q$
- B$2q = 3p$
- C$q = 3p$
- D$2p = 3q$
Explore More
Similar Questions
Maximize the function $Z = 11x + 7y$,subject to the constraints:
$x \leq 3, y \leq 2, x \geq 0, y \geq 0$
$x \leq 3, y \leq 2, x \geq 0, y \geq 0$
Medium
View SolutionIf a Linear Programming Problem $(L.P.P.)$ has optimum solutions at two consecutive corner points of the feasible region,then the $L.P.P.$ has:
The feasible region for an $LPP$ is shown in the figure. Let $z = 3x - 4y$ be the objective function. The minimum value of $Z$ is:
Medium
View SolutionConsider the following statements:
Statement $(I)$: In a $LPP$,the objective function is always linear.
Statement $(II)$: In a $LPP$,the linear inequalities on variables are called constraints.
Which of the following is correct?
Statement $(I)$: In a $LPP$,the objective function is always linear.
Statement $(II)$: In a $LPP$,the linear inequalities on variables are called constraints.
Which of the following is correct?
If an $LPP$ admits an optimal solution at two consecutive vertices of a feasible region,then:
MediumKCET 2017
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