In a LPP, let R be the feasible region.

A. If R is unbounded then a max./min. value of objective function may not exist.

B. If R is bounded then a max. and min. value of objective function will always exist.

C. If a solution exists, it must occur at a corner point.

D. If R is bounded then max. will exist but min. may or may not exist for an objective function.

Choose the correct answer from the options given below:

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

If a, b, c > 0 and $ax+by>c$, then its graph represents:

The corner points of the bounded feasible region of a linear programming problem are A(15,0), B(40,0), C(4, 18), D(6, 12) and objective function is $z = 20x+10y$, then which of the following are TRUE?

(A) Value of z at point A(15, 0) = 300.

(B) Value of z at point B(40, 0) = 800.

(C) Value of z at point C(4, 18) = 340.

(D) Maximum value of z = 800.

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

A furniture trader deals in only two items - chairs and tables. He has Rs. 50,000 to invest and a space to store almost 35 items. A chair costs him Rs. 1000 and a table costs him Rs. 2000. The trader earns a profit of Rs. 150 and Rs. 250 on a chair and a table, respectively. Choose the correct option among following that describes the given linear programming problem (LPP) to maximize the profit ( where x and y are the number of chairs and tables that trader buys and sells)?

The number of corner points of the feasible region of an LPP determined by the constraints $x - y \geq 0$, $2y \leq x + 2, x \geq 0, y \geq 0$ is