In a Linear Programming problem, the objective function is always :

Which one of the following set of constraints does the given shaded region represent?

The minimum value of $z = 3x + 2y$ subjected to the constraints $2x + y \geq 7, x + 2y \geq 8, x, y \geq 0$ is

The feasible region of inequality $2x + 3y > 6$ is

The corner points of the feasible region determined by inequalities of LPP are $(4, 10)$, $(6, 8)$ and $(6, 5)$. Let $z = 3x + 4y$ be the objective function. Then the sum of maximum value of z and minimum value of z is :

The maximum value of $z = 3x + 4y$ subject to the constraints

$x + y \geq 2, 2x + 3y \leq 6, x \geq 0, y \geq 0$ is

Owner of a whole sale computers shop plans to sell 2 types of computers. A desktop and portable model. If $x$ is the number of desktops and $y$ is the number of portable model and the shop's capacity cannot exceed 250 units. Which of the following is correct ?