The sum of the x-coordinates of the corner points of the feasible region for the LPP: Minimize $z = 3x + 2y$ subject to constraints $x + y \leq 14$, $x \geq 4$, $x \leq 8, y \geq 0$ is

A feasible solution is :

The feasible region of the linear programming problem is represented below:

The constraints of this LPP are

If the feasible region (shaded portion)of a LPP is as shown in the graph, then max $z = 50x + 15y$ is:

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:

The corner points of the bounded feasible region determined by the system of linear constraints are $(0, 0)$, $(5, 0)$, $(6, 5)$, $(6, 8)$, $(4, 10)$, $(0, 8)$. Let $Z = 3x - 4y$ be the objective function. The minimum value of Z occurs at

If the optimal value of the objective function $z = px + y$ of an L.P.P occurs at two corner points (2, 11) and (4, 5) of its bounded feasible region, then its optimal value is