A linear programming problem is as follows: Minimize $z = 2x + 3y$ Subject to the constraints $x \ge 3, x \le 9, y \ge 0, x - y \ge 0, x + y \le 14$. The feasible region has 5 corner points including

Linear inequalities corresponding to the shaded feasible region OABCO in the given figure are

Consider the linear programming problem(LPP):

Minimize $Z = x + y$

$x + 2y \leq 4,$

$3x + y \geq 3,$

$4x + 3y \geq 6,$

$x, y \geq 0.$

Which of the following is correct for the above linear programming problem (LPP):

(A) The LPP has a bounded feasible region.

(B) The LPP has a unique optimal solution.

(C) The optimal value of the LPP exists at the point (3/2, 0)

(D) The corner points of the feasible region are (3/2, 0), (3/5, 6/5), (2/5, 6/5) and (4, 0)

Choose the correct answer from the options given below:

If the objective function $Z = px + qy, p > 0, q > 0$ of a linear programming problem attains its optimal value at the points (4, 7) and (5, 5) and $pq = 50$ then

Consider the linear programming problem (LPP):

Max Z= 4x + 3y

subject to the constraints:

$x\le 8, y\le 4, x\ge 0, y\ge 0$. At what coordinates will the objective function have optimal solution?

If the feasible region of an LPP is bounded and the corresponding objective function is $z = 5x - 9y$, then the objective function attains:

The shaded unbounded area of an LPP is the result of constraints: