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 the objective function $z = 10x + 15y$ of an L.P.P. subjected to the constraints

$2x + 4y \leq 8$,

$3x + y \leq 6$,

$-x - y \geq -4$,

$x \geq 0$, $y \geq 0$ is:

Consider the LPP: Minimize $Z = x + 2y$ subject to $2x + y \geq 3$, $x + 2y \geq 6$, $x, y \geq 0$. The optimal feasible solution occurs at

The vertices of a closed convex polygon representing the feasible region of the LPP with, objective function $z = 5x + 3y$ are $(0, 0)$, $(3, 1)$, $(1, 3)$ and $(0, 2)$. The maximum value of $z$ is

Consider the following L.P.P.

Minimize z = 400x + 300y subject to 100x + 200y ≥ 12000, 300x + 400y ≥ 20000, 200x + 100y ≥ 15000 and x, y ≥ 0. Then

Which of the following terms are associated with a linear programming problem?

(A) Constraints

(B) Independent events

(C) Feasible region

(D) Objective function

Choose the correct answer from the options given below:

The corner points of the bounded feasible region determined by the system of linear constraints of an LPP are (0, 0), (0, 8), (5, 0) and (4, 10). Let $z = 3x - 4y$ be the objective function, then the minimum value of $z$ is: