# NCERT Class 12-Mathematics: Chapter – 12 Linear Programming Part 5 (For CBSE, ICSE, IAS, NET, NRA 2022)

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

Question 3:

Maximise the function , subject to the constraints: .

Answer:

Question 4:

Minimise subject to the constraints: .

Answer:

Question 5:

Determine the maximum value of if the feasible region (shaded) for a LPP is shown in Fig. 12.7. Fig-12.7-the Feasible Region (Shaded) for a LPP

Answer:

Question 6:

Feasible region (shaded) for a LPP is shown in Fig. 12.8.

Maximise Z = 5x + 7y. Fig. 12.8-Feasible Region (Shaded) for a LPP

Answer:

Question 7:

The feasible region for a LPP is shown in Fig. 12.9. Find the minimum value of . Fig. 12.9-Find the Minimum Value

Answer:

Question 8:

Refer to Exercise above. Find the maximum value of Z.

Answer:

Question 9:

The feasible region for a LPP is shown in Fig. 12.10. Evaluate at each of the corner points of this region. Find the minimum value of Z, if it exists. Fig. 12.10-Find the Minimum Value of Z

Answer:

Question 10:

In Fig. 12.11, the feasible region (shaded) for a LPP is shown. Determine the maximum and minimum value of Fig. 12.11-Determine the Maximum and Minimum Value

Answer: