The feasible region of the $L$.$P$.$P$. (Linear Programming Problem) to maximize $z = 70x + 50y$ subject to the constraints $8x + 5y \leq 60$,$4x + 5y \leq 40$ and $x \geq 0, y \geq 0$ is:

  • A
    a triangle
  • B
    a square
  • C
    a pentagon
  • D
    a quadrilateral

Explore More

Similar Questions

The objective function $z = 4x + 5y$ subject to the constraints $2x + y \geq 7$,$2x + 3y \leq 15$,$y \leq 3$,$x \geq 0$,and $y \geq 0$ has a minimum value at which point?

If the feasible region is as shown in the figure,then the related inequalities are:

The shaded area in the given figure is a solution set for some system of inequations. The maximum value of the function $z=10x+25y$ subject to the linear constraints given by the system is

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 shaded area in the figure below is the solution set for a certain linear programming problem. The linear constraints are given by:

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