The corner points of the feasible region determined by the following 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 = px + qy$,where $p, q > 0$. The condition on $p$ and $q$ so that the maximum of $Z$ occurs at both $(3,4)$ and $(0,5)$ is:
- A$p = q$
- B$q = 3p$
- C$p = 3q$
- D$p = 2q$
Explore More
Similar Questions
The objective function of a Linear Programming Problem $(L.P.P.)$ defined over a convex set attains its optimum value at
If an $LPP$ admits an optimal solution at two consecutive vertices of a feasible region,then:
MediumKCET 2017
View SolutionShow that the minimum of $Z$ occurs at more than two points.
Maximize $Z = x + y$,subject to $x - y \leq -1$,$-x + y \leq 0$,$x, y \geq 0$.
Maximize $Z = x + y$,subject to $x - y \leq -1$,$-x + y \leq 0$,$x, y \geq 0$.
Medium
View SolutionThe corner points of the feasible region determined by the system of linear constraints are $(2, 72)$,$(15, 20)$,and $(40, 15)$. Let $Z = 6x + 3y$ be the objective function. The minimum value of $Z$ occurs at:
The feasible region for a $LPP$ is shown in the figure. Find the minimum value of $Z=11x+7y$.
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