The feasible region of a LPP is bounded. The corresponding objective function is Z= 6x - 7y. Then objective function attains:

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 for a LPP is shown in the given figure. The maximum value of $z = 2x + 5y$ is :

If the objective function z = 4x + 3y has maximum value on a line joining points (3, a) and (b, 2) where a > 0, b > 0 such that a - b = 2, then the maximum value of z is:

The corner points of the feasible region determined by the system of linear constraints are (0, 0), (0, 40), (20, 40), (60, 20), (60, 0). The objective function is $z = 4x + 3y$.

Compare the quantity in Column - A and Column - B.

The corner points of the feasible region associated with the LPP: Maximise $Z = px + qy$, $p,q > 0$ subject to $2x + y \leq 10$, $x + 3y \leq 15$, $x, y \geq 0$ are (0, 0), (5, 0), (3, 4) and (0, 5). If optimum value occurs at both (3, 4) and (0, 5), then

The programming problem

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