# NCERT Class 12-Mathematics: Chapter –12 Linear Programming Part 8

Glide to success with Doorsteptutor material for CBSE : fully solved questions with step-by-step explanation- practice your way to success.

Download PDF of This Page (Size: 146K) ↧

**Question 29:**

Refer to Exercise 27. (Maximum value of Minimum value of Z) is equal to

(A)

(B)

(C)

(D)

**Answer: D**

**Question 30:**

The feasible region for an LPP is shown in the Fig. 12.13. Let be the objective function. Maximum value of F is.

(A)

(B)

(C)

(D)

**Answer: C**

**Question 31:**

Refer to Exercise 30. Minimum value of F is

(A)

(B)

(C)

(D) Does not exist

**Answer: D**

**Question 32:**

Corner points of the feasible region for an LPP are and.

Let be the objective function.

The Minimum value of F occurs at

(A) Only

(B) Only

(C) The mid-point of the line segment joining the points and only

(D) Any point on the line segment joining the points and .

**Answer: D**

**Question 33:**

Refer to Exercise, Maximum of Minimum of

(A)

(B)

(C)

(D)

**Answer: A**

**Question 34:**

Corner points of the feasible region determined by the system of linear constraints are and . Let , where . Condition on and so that the minimum of Z occurs at and is

(A)

(B)

(C)

(D)

**Answer: B**