The maximum value of a LPP $z = 3x + 4y$ subject to the constraints: $x + y \leq 6$, $x \geq 0$, $y \geq 0$ is:

In a linear programming problem, the corner points of the feasible region, determined by the system of linear inequalities are (0, 0), (5, 0), (3, 4) and (0, 5). Let $z=5x+qy, q>0$ be the objective function. For what value of q the maximum value of z occurs at both (3, 4) and (0, 5)?

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

The feasible region of an LPP Max $Z = 3x + 2y$ subject to $x \geq 0, y \geq 0, x - 2y \leq 3$ is:

In a linear programming problem, the constraints on decision variables $x$ and $y$ are $y-2x \leq 0$, $y \geq 0$, $0 \leq x \leq 5$. The feasible region of the above problem:

For the LPP

Maximise $z = x + y$

subject to $x - y \leq -1$, $-x + y \leq 2$, $x, y \geq 0$, $z$ has :

Which of the following group of constraints represents the feasible region given as shaded area below ?