The optimal value of the objective function is attained at the points

The corner points of the feasible region determined by the system of linear constraints are $(2, 72)$,$(15, 20)$,and $(40, 15)$. Let $Z = 6x + 3y$ be the objective function. The minimum value of $Z$ occurs at:

If for a linear programming problem the feasible region is bounded,then the objective function has . . . . . . .

If a Linear Programming Problem $(L.P.P.)$ has optimum solutions at two consecutive corner points of the feasible region,then the $L.P.P.$ has:

The corner points of the feasible region determined by the following system of linear inequalities: $2x + y \leq 10$,$x + 3y \leq 15$,$x, y \geq 0$ are $(0,0)$,$(5,0)$,$(3,4)$,and $(0,5)$. Let $Z = px + qy$,where $p, q > 0$. The condition on $p$ and $q$ so that the maximum of $Z$ occurs at both $(3,4)$ and $(0,5)$ is:

Determine graphically the minimum value of the objective function
$Z = -50x + 20y$ .....$(1)$
subject to the constraints:
${2x - y \geqslant -5}$ .....$(2)$
${3x + y \geqslant 3}$ .....$(3)$
${2x - 3y \leqslant 12}$ .....$(4)$
${x \geqslant 0, y \geqslant 0}$ .....$(5)$