The objective function of an LPP is $z = ax + \beta y, (a, \beta > 0)$ in that has to be maximized/minimized subject to constraints $x + y \leq 2$, $x \geq 0$, $y \geq 0$. Then max (z) $-$ min (z) is equal to

Let the corner points of the bounded feasible region of the linear programming problem (LPP) $Z = ax+by$ be: (0, 0), (2, 0), (20/19, 45/19) and (0, 3). If the optimal value of Z occurs at both points (2, 0) and (20/19, 45/19), then the relation between a and b is:

The feasible region for an LPP is shown in the given figure. Let $Z=3x+4y$ be the objective function. Then which of the following is/are TRUE?

(A) The minimum value of Z is 156

(B) The minimum value of Z is 152

(C) The maximum value of Z is 196

(D) Neither minimum nor maximum value of Z exists

Choose the correct answer from the options given below:

If the objective function for an LPP is $Z=4x+5y$ and the corner points for bounded feasible region are (10, 0), (5, 3), (2, 5) and (0, 6), then the minimum value of $Z$ occurs at

The feasible region associated with the inequality $2x + 3y > 4$ is

An objective function $z = ax + by$ is maximum at points (15,15) and (0, 20). If $a, b \geq 0$ and $ab = 27$, then the maximum value of the objective function is

The programming problem

Max $Z = 2x + 3y$ subject to the conditions $0 \leq x \leq 3, 0 \leq y \leq 4$ is :