The feasible region for a LPP is shown in the given figure. The maximum value of $z = 2x + 5y$ is :

If the feasible region (shaded portion)of a LPP is as shown in the graph, then max $z = 50x + 15y$ is:

Which one of the following set of constraints represents the shaded region given below?

The feasible region of a linear programming problem is bounded. The corresponding objective function is Z= 3x-4y. The objective function attains

The corner points of the feasible region determined by $x+y \leq 8, 2 x+y \geq 8, x \geq 0, y \geq 0$ are $A(0,8), B(4,0)$ and $C(8,0)$. If the objective function $Z=a x+$ by has its maximum value on the line segment $A B$, then the relation between $a$ and $b$ is :

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 corner points O, A, B, C, D and E of the bounded feasible region determined by the system of linear constraints are shown in the given figure.

If $z = 3x - 4y$ be the objective function, then the minimum of z, is: