Match List - I with List - II.

List - I	List - II
(A) The common region determined by all the constraints of LPP is called	(I) objective function
(B) Minimize $z = c_1x_1 + c_2x_2 + ..... + c_nx_n$ is	(II) convex set
(C) A solution that also satisfies the non-negative restrictions of a LPP is called	(III) feasible region
(D) The set of all feasible solutions of a LPP is a	(IV) feasible solution

Choose the correct answer from the options given below :

A Linear Programming Problem (LPP) consists of which of the following components?

(A) Decision variables

(B) The graphical compliment

(C) The objective function

(D) The linear constraints

Choose the correct answer from the options given below:

The maximum value of $z = 4x + 2y$, subjected to the constraints:

$2x + 3y \le 18$, $x + y \ge 5$;

$x, y \ge 0$, is

The maximum profit per week is :

Match List-I with List-II

Choose the correct answer from the options given below:

Consider a L.P.P, Maximize $Z = 3x + 5y$ subject to constraints $2x + 6y ≤ 6$, $x - y ≥ 0$, $x ≥ 0$, $y ≥ 0$. Then which of the following are true?

(A) The feasible region of L.P.P is bounded region

(B) The corner points of the feasible region are (0, 0), (2, 2), (0, 1)

(C) Maximum value of Z is 9

(D) Point (1, 3) lies in the feasible region

Choose the correct answer from the options given below:

Which of the following statements are correct in reference to the linear programming problem(LPP):

Maximize ${Z} = 5x + 2y$

subject to the following constraints

$3x + 5y \leq 15$, $5x + 2y \leq 10$, $x \geq 0, y \geq 0$.

(A) The LPP has a unique optimal solution at $(2, 0)$ only.

(B) The feasible region is bounded with corner points $(0, 0)$, $(2, 0)$, $(20/19, 45/19)$ and $(0, 3)$.

(C) The optimal value is unique, but there are an infinite number of optimal solutions.

(D) The feasible region is unbounded.

Choose the correct answer from the options given below: