The correct constraints for the given feasible region are:

Minimize the objective function $Z = 3x + 2y$ subject to the constraints: $x + y \geq 8$,$x + y \leq 5$,$x \geq 0$,$y \geq 0$.

$A$ diet of a sick person must contain at least $4000$ units of vitamins,$50$ units of proteins,and $1400$ calories. Two foods $A$ and $B$ are available at a cost of ₹ $4$ and ₹ $3$ per unit respectively. If one unit of $A$ contains $200$ units of vitamins,$1$ unit of protein,and $40$ calories,while one unit of food $B$ contains $100$ units of vitamins,$2$ units of protein,and $40$ calories,formulate the problem so that the diet is the cheapest.

$A$ manufacturing company produces two items,$A$ and $B$. Each item must be processed by two machines,$I$ and $II$. Machine $I$ can be operated for a maximum of $10$ hours $40$ minutes ($640$ minutes). It takes $20$ minutes for an item $A$ and $15$ minutes for an item $B$. Machine $II$ can be operated for a maximum of $8$ hours $20$ minutes ($500$ minutes). It takes $5$ minutes for an item $A$ and $8$ minutes for an item $B$. The profit per item of $A$ is ₹ $25$ and per item of $B$ is ₹ $18$. The formulation of an $L.P.P.$ to maximize the profit (where $x$ is the number of items $A$ and $y$ is the number of items $B$) is . . . . . . .

For the linear programming problem, $x + 2y \leq 10$, $3x + y \leq 12$, $x, y \geq 0$, the maximum value of $z = 5x + 10y$ occurs at every point on the line segment joining the points..

The minimum value of $t = 7x + 3y$ subject to constraints $x + y < 5$,$x + y < 10$,$x > 0$,$y > 0$ is . . . . . .