Solve the following linear programming problem graphically:
Minimise $Z = 200x + 500y$.......$(1)$
subject to the constraints:
$x + 2y \geqslant 10$.......$(2)$
$3x + 4y \leqslant 24$.....$(3)$
$x \geqslant 0, y \geqslant 0$......$(4)$

  • A
    $2300$
  • B
    $2400$
  • C
    $2500$
  • D
    $2600$

Explore More

Similar Questions

Maximize the function $Z = 11x + 7y$,subject to the constraints:
$x \leq 3, y \leq 2, x \geq 0, y \geq 0$

The corner points of the feasible region are $A(0,0)$,$B(16,0)$,$C(8,16)$,and $D(0,24)$. The minimum value of the objective function $z = 300x + 190y$ is . . . . . . .

In a linear programming problem $(LPP)$, if the objective function $Z = ax + by$ has the same maximum value at two distinct corner points, then the number of points at which $Z_{max}$ occurs is

Consider a $LPP$ given by minimize $Z = 6x + 10y$. Subject to $x \geq 6, y \geq 2, 2x + y \geq 10, x \geq 0, y \geq 0$. Redundant constraints in this $LPP$ are $....$

The feasible region for a $LPP$ is shown in the figure. Find the minimum value of $Z=11x+7y$.

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