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

In a Linear Programming Problem ($L$.$P$.$P$.), the corner points of the feasible region determined by the constraints $3x - y \geq 6$, $x \leq 3$, $y \leq 2$, $y \geq 0$, and $x \geq 0$ are:

Corner points of the feasible region for an $\operatorname{LPP}$ are $(0,2), (3,0), (6,0), (6,8)$ and $(0,5)$. Let $F = 4x + 6y$ be the objective function. Find the value of $\text{Maximum of } F - \text{Minimum of } F$.

The corner points of the feasible region determined by the system of linear constraints are $(0,0), (0,40), (20,40), (60,20), (60,0)$. The objective function is $z=4x+3y$. Compare the quantity in Column $A$ and Column $B$.
Column Value
$A$. Maximum of $z$ $300$
$B$. Constant value $325$

The 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:

For a linear programming problem, the objective function is $z = px + qy$, where $p, q > 0$. If at the corner points $(0, 10)$ and $(5, 5)$ the values of $z$ are $90$ and $60$ respectively, then the relation between $p$ and $q$ is . . . . . . .

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo