The maximum value of $z = 4x + 3y$, if the feasible region for an LPP is as shown below is:

The maximum value of the objective function $Z = 2x + y$ of an LPP, subject to the constraints $x \leq 6, y \leq 2, x - y \leq 0$, $x \geq 0, y \geq 0$ is

The maximum value of the objective function $z = 10x + 15y$ of an L.P.P. subjected to the constraints

$2x + 4y \leq 8$,

$3x + y \leq 6$,

$-x - y \geq -4$,

$x \geq 0$, $y \geq 0$ is:

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 bounded feasible region determined by the system of linear constraints are $(0,8)$, $(4,4)$, $(12,12)$, $(0,20)$. Let $z = px + qy$, where $p, q > 0$. Condition on $p$ and $q$ so that the maximum of $z$ occurs at both the points $(12,12)$, $(0,20)$ is

Consider the following L.P.P.

Minimize z = 400x + 300y subject to 100x + 200y ≥ 12000, 300x + 400y ≥ 20000, 200x + 100y ≥ 15000 and x, y ≥ 0. Then

The feasible region corresponding to the linear constraints of a Linear Programming Problem (LPP) is represented by the shaded region in the given figure. Which of the following is not a constraint to the given LPP?