The feasible solution for a Linear Programming Problem $(LPP)$ is shown in the figure. Let $z = 3x - 4y$ be the objective function. The value of (Maximum value of $z$ + Minimum value of $z$) is equal to $....$

  • A
    $13$
  • B
    $01$
  • C
    $-13$
  • D
    $-17$

Explore More

Similar Questions

Solve the following Linear Programming Problem graphically:
Minimise $Z = -3x + 4y$
Subject to the constraints:
$x + 2y \leq 8$
$3x + 2y \leq 12$
$x \geq 0, y \geq 0$

$z = 30x - 30y + 1800$ is an objective function. The corner points of the feasible region are $(15, 0), (15, 15), (10, 20), (0, 20),$ and $(0, 15)$. $z$ has the minimum value at $\ldots$ point.

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

Determine the maximum value of $Z=11 x+7 y$ subject to the constraints:
$2 x+y \leq 6, x \leq 2, x \geq 0, y \geq 0$

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:

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