# Example 5 - Chapter 12 Class 12 Linear Programming (Term 1)

Last updated at Dec. 17, 2018 by Teachoo

Last updated at Dec. 17, 2018 by Teachoo

Transcript

Example 5 - Chapter 2 Class 12 Linear Programming - NCERT Minimise Z = 3x + 2y subject to the constraints: x + y ≥ 8 3x + 5y ≤ 15 x ≥ 0, y ≥ 0 Plotting points For x + y ≥ 8 Points are (0, 8) and (8, 0) For 3x + 5y ≤ 15 Points are (0, 3) and (5, 0) Plotting graphs of both lines And shading the relevant parts We notice that There is no common region, thus, there is no feasible region. Hence, there is no maxnimum value of Z

Examples

Example 1

Example 2

Example 3 Important

Example 4 Important Deleted for CBSE Board 2022 Exams

Example 5 You are here

Example 6 Important Deleted for CBSE Board 2022 Exams

Example 7 Important Deleted for CBSE Board 2022 Exams

Example 8 Deleted for CBSE Board 2022 Exams

Example 9 Important Deleted for CBSE Board 2022 Exams

Example 10 Deleted for CBSE Board 2022 Exams

Example 11 Important Deleted for CBSE Board 2022 Exams

Chapter 12 Class 12 Linear Programming (Term 1)

Serial order wise

About the Author

Davneet Singh

Davneet Singh is a graduate from Indian Institute of Technology, Kanpur. He has been teaching from the past 10 years. He provides courses for Maths and Science at Teachoo.