The corner points of the feasible region determined by a 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$ such that the minimum of $Z$ occurs at both $(3,0)$ and $(1,1)$ is $.....$

  • A
    $p = 2q$
  • B
    $p = \frac{q}{2}$
  • C
    $p = 3q$
  • D
    $p = q$

Explore More

Similar Questions

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 feasible region for a $LPP$ is shown in the figure. Find the maximum value of $Z=11x+7y$.

The maximum value of $Z = 3x + 4y$ subject to the constraints $x + y \leq 4, x \geq 0, y \geq 0$ is . . . . . . .

In solving the $LP$ problem: "Minimize $z = 6x + 10y$ subject to $x \geq 6, y \geq 2, 2x + y \geq 10, x \geq 0, y \geq 0$." The redundant constraints are $....$

The constraints $-x+y \leq 1, -x+3y \leq 9, x \geq 0, y \geq 0$ define a:

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