For the Linear Programming Problem ($L$.$P$.$P$.),maximize $z = 4x_1 + 2x_2$ subject to the constraints $3x_1 + 2x_2 \geq 9$,$x_1 - x_2 \leq 3$,$x_1 \geq 0$,$x_2 \geq 0$,the problem has:

  • A
    Infinite number of optimal solutions
  • B
    Unbounded solution
  • C
    No solution
  • D
    One optimal solution

Explore More

Similar Questions

The feasible region for the constraints $x-y \geqslant 0$,$x-5y \leqslant -5$,$x \geqslant 0$,$y \geqslant 0$ is shown by the figure:

The function to be maximized is given by $Z=2x+y$. The feasible region for this function $Z$ is the shaded region shown in the figure. The maximum value of $Z$ is . . . . . . and occurs at the point . . . . . . .

The maximum value of $z = 3x + 5y$ subject to the constraints $3x + 2y \leq 18$,$x \leq 4$,$y \leq 6$,$x, y \geq 0$,is

The $L$.$P$.$P$. to maximize $Z = x + y$,subject to $x + y \leq 1$,$2x + 2y \geq 6$,$x \geq 0$,$y \geq 0$ has

The feasible region of an $LPP$ is shown in the figure. If $z=11x+7y$,then the maximum value of $z$ 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