# NCERT Solutions for Exercise 12.1 Class 12 Maths Chapter 12 - Linear Programming

NCERT solutions for exercise 12.1 Class 12 Maths chapter 12 gives practice questions to understand linear programming problems. There are 10 questions explained in exercise 12.1 Class 12 Maths. There are many methods to solve linear programming problems. Here in this Class 12 NCERT Mathematics chapter, only graphical methods for solving linear programming problems are discussed. In the NCERT Solutions for class 12 maths chapter 12 exercise 12.1 all the 10 questions are solved using graphs. Class 12 Maths chapter 12 exercise 12.1 solves problems related to maximising or minimising linear functions subjected to certain constraints. These constraints are a set of linear inequalities. Concepts of linear inequalities are already introduced in Class 11 Mathematics NCERT book. Other than Class 12 Maths chapter 12 exercise 12.1 solutions there are two more exercises.

Linear Programming Exercise 12.2

Linear Programming Miscellaneous Exercise

** ****Linear Programming Class 12 Chapter** **12****-Exercise: 12.1**** **

** Question:1 ** Solve the following Linear Programming Problems graphically: Maximise Subject to the constraints Show that the minimum of Z occurs at more than two points.

** Answer: **

The region determined by constraints, is as follows,

The region A0B represents the feasible region

The corner points of the feasible region are

Maximize

The value of these points at these corner points are :

Corner points | ||

12 | ||

0 | ||

16 | maximum |

The maximum value of Z is 16 at

** Question:2 ** Solve the following Linear Programming Problems graphically: Minimise Subject to . Show that the minimum of Z occurs at more than two points

** Answer: **

The region determined by constraints, is as follows,

The corner points of feasible region are

The value of these points at these corner points are :

Corner points | ||

6 | ||

-12 | Minimum | |

0 | ||

16 |

The minimum value of Z is -12 at

** Question:3 ** Solve the following Linear Programming Problems graphically: Maximise Subject to , , Show that the minimum of Z occurs at more than two points.

** Answer: **

The region determined by constraints, , , is as follows :

The corner points of feasible region are

The value of these points at these corner points are :

Corner points | ||

9 | ||

0 | ||

10 | ||

Maximum |

The maximum value of Z is at

** Question:4 ** Solve the following Linear Programming Problems graphically: Minimise Such that Show that the minimum of Z occurs at more than two points.

** Answer: **

The region determined by constraints is as follows,

The feasible region is unbounded as shown.

The corner points of the feasible region are

The value of these points at these corner points are :

Corner points | ||

9 | ||

7 | Minimum | |

10 | ||

The feasible region is unbounded, therefore 7 may or may not be the minimum value of Z .

For this, we draw and check whether resulting half plane has a point in common with the feasible region or not.

We can see a feasible region has no common point with.

Hence, Z has a minimum value of 7 at

** Question:5 ** Solve the following Linear Programming Problems graphically: Maximise Subject to Show that the minimum of Z occurs at more than two points.

** Answer: **

The region determined by constraints, is as follows,

The corner points of feasible region are

The value of these points at these corner points are :

Corner points | ||

15 | ||

18 | Maximum | |

10 | ||

The maximum value of Z is 18 at

** Question:6 ** Solve the following Linear Programming Problems graphically: Minimise Subject to

Show that the minimum of Z occurs at more than two points.

** Answer: **

The region determined by constraints is as follows,

The corner points of the feasible region are

The value of these points at these corner points are :

Corner points | |

6 | |

6 |

Value of Z is the same at both points.

If we take any other point like on line , then Z=6.

Thus the minimum value of Z occurs at more than 2 points .

Therefore, the value of Z is minimum at every point on the line .

** Question:7 ** Solve the following Linear Programming Problems graphically: Minimise and Maximise Subject to Show that the minimum of Z occurs at more than two points.

** Answer: **

The region determined by constraints, is as follows,

The corner points of feasible region are

The value of these points at these corner points are :

Corner points | ||

400 | ||

600 | Maximum | |

300 | Minimum | |

600 | maximum |

The minimum value of Z is 300 at and maximum value is 600 at all points joing line segment and

** Question:8 ** Solve the following Linear Programming Problems graphically: Minimise and Maximise Subject to Show that the minimum of Z occurs at more than two points.

** Answer: **

The region determined by constraints is as follows,

The corner points of the feasible region are

The value of these points at these corner points are :

Corner points | ||

100 | Minimum | |

100 | Minimum | |

250 | ||

400 | Maximum |

The minimum value of Z is 100 at all points on the line segment joining points and .

The maximum value of Z is 400 at .

** Question:9 ** Solve the following Linear Programming Problems graphically: Maximise Subject to the constraints: Show that the minimum of Z occurs at more than two points.

** Answer: **

The region determined by constraints is as follows,

The corner points of the feasible region are

The value of these points at these corner points are :

Corner points | ||

- 6 | minimum | |

-2 | ||

1 | maximum | |

The feasible region is unbounded, therefore 1 may or may not be the maximum value of Z.

For this, we draw and check whether resulting half plane has a point in common with a feasible region or not.

We can see the resulting feasible region has a common point with a feasible region.

Hence , Z =1 is not maximum value , Z has no maximum value.

** Question:10 ** Solve the following Linear Programming Problems graphically: Maximise Subject to Show that the minimum of Z occurs at more than two points.

** Answer: **

The region determined by constraints is as follows,

There is no feasible region and thus, Z has no maximum value.

**More About NCERT Solutions for Class 12 Maths Chapter 12 Exercise 12.1**

In order to understand the concepts well it is important to solve the NCERT syllabus exercise questions. The NCERT solutions for Class 12 Maths chapter 12 exercise 12.1 helps in solving the first exercise of the chapter linear programming. Students can make use of Class 12 Maths chapter 12 exercise 12.1 solutions for preparation of board exams as well as engineering entrance exam like JEE Mains.

**Also Read| **Linear Programming Class 12th Notes

**Benefits of NCERT Solutions for Class 12 Maths Chapter 12 Exercise 12.1**

Class 12th Maths chapter 12 exercise 12.1 are prepared by the best faculties of Mathematics

All main topics are covered and exercise 12.1 Class 12 Maths gives answers to all the questions and are in detail

Students can use Class 12 Maths chapter 12 exercise 12.1 to prepare for CBSE exams

**Also see-**

NCERT Exemplar Solutions Class 12 Maths Chapter 12

NCERT Solutions for Class 12 Maths Chapter 12

**NCERT Solutions Subject Wise**

NCERT Solutions Class 12 Chemistry

NCERT Solutions for Class 12 Physics

NCERT Solutions for Class 12 Biology

NCERT Solutions for Class 12 Mathematics

**Subject Wise NCERT Exemplar Solutions**

NCERT Exemplar Class 12 Maths

NCERT Exemplar Class 12 Physics

NCERT Exemplar Class 12 Chemistry

NCERT Exemplar Class 12 Biology