The Linear Programming Problem ($L$.$P$.$P$.) to minimize $z = 30x + 20y$ subject to the constraints $x + y \leqslant 8$,$x + 2y \geqslant 4$,$6x + 4y \geqslant 12$,$x \geqslant 0$,and $y \geqslant 0$ has:

  • A
    a unique solution
  • B
    infinitely many solutions
  • C
    minimum value at $(4, 0)$
  • D
    no feasible solution

Explore More

Similar Questions

The point at which the maximum value of $Z = x + y$ subject to the constraints $x + 2y \leq 70$, $2x + y \leq 95$, $x \geq 0$, $y \geq 0$ occurs is:

$A$ man rides his motorcycle at the speed of $50 \, km/h$. He has to spend $Rs. \, 2$ per $km$ on petrol. If he rides it at a faster speed of $80 \, km/h$,the petrol cost increases to $Rs. \, 3$ per $km$. He has at most $Rs. \, 120$ to spend on petrol and one hour's time. He wishes to find the maximum distance that he can travel. Express this problem as a linear programming problem.

Difficult
View Solution

The solution set of the constraints $2x + 3y \leq 6$,$x + 4y \leq 4$,$x \geq 0$,and $y \geq 0$ includes the point $\ldots$ as a corner point.

The difference between the maximum value and minimum value of the objective function $z = 3x + 5y$ subject to the constraints $x + 3y \leqslant 60$,$x + y \geqslant 10$,$x - y = 0$,and $x, y \geqslant 0$ is:

The solution set of the inequalities $4x + 3y \leq 60$,$y \geq 2x$,$x \geq 3$,$x, y \geq 0$ is represented by which region?

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