Consider an LPP:

Maximize $Z = 5x + y$

Subject to $x + 3y \le 12$

$3x + y \le 12$

and $x,y \ge 0$

then which of the following statements are TRUE ?

A. The corner points of the bounded feasible region are (0,0), (4,0), (3,3) and (0,4).

B. Maximum value of $z$ occurs at (3,3).

C. Maximum value of $z$ occurs at (4,0).

D. The maximum value of $z$ is 20.

Choose the correct answer from the options given below:

The corner points of the bounded feasible region determined by a set of constraints (linear inequalities) are A(0, 5), B(3, 5), C(5, 0) and D(4, 1) and the objective function is z = $px$ + 2$qy$ where p,q > 0. The condition on $p$ and $q$ such that the maximum z occurs at B and D, is:

The corner points of the bounded feasible region determined by $x+3y\le60, x+y\ge10, x\le y, x\ge0, y\ge0$ are A(0, 10), B(5, 5), C(15, 15) and D(0, 20). If the objective function $z=ax+by$ has its maximum value on the line segment CD, then the relation between $a$ and $b$ is:

The linear constraints, for which the shaded area in the figure is the feasible region of an LPP, are :

From the below-mentioned graph of shaded feasible region of a linear programming problem (LPP) with objective function

$z = 1.50x + 1.00y$; the maximum value of $z$ will be:

The optimal solution of the Linear Programming problem

Maximize $Z = 3x_1 + 5x_2$,

s.t. $3x_1 + 2x_2 \leq 18$

$x_1 \leq 4$

$x_2 \leq 6$

$x_1 \geq 0, x_2 \geq 0$ 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: