For the $LP$ problem,"Maximize $z = x + 4y$ subject to $3x + 6y \leq 6$,$4x + 8y \geq 16$ and $x \geq 0, y \geq 0$."

  • A
    $4$
  • B
    $8$
  • C
    feasible region is unbounded
  • D
    has no feasible region

Explore More

Similar Questions

The objective function of a Linear Programming Problem $(LPP)$ is

In the following figure,the feasible region (shaded) for a $LPP$ is shown. Determine the maximum and minimum value of $Z=x+2y$.

Value of the objective function $Z = -50x + 20y$ subject to the constraints $2x - y \geq -5$,$3x + y \geq 3$,$2x - 3y \leq 12$,$x \geq 0$,$y \geq 0$. The corner points of the feasible region are $(0, 5)$,$(0, 3)$,$(1, 0)$,and $(6, 0)$. At which point is the value of $Z$ minimum?

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:

The corner points of the feasible region of an $LPP$ are $(0,2), (3,0), (6,0), (6,8)$ and $(0,5)$. Then the minimum value of $z = 4x + 6y$ occurs at:

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