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

Last updated at Feb. 17, 2020 by

Last updated at Feb. 17, 2020 by

Transcript

Example 3 Solve the following problem graphically: Minimise and Maximise Z = 3x + 9y subject to the constraints: x + 3y ≤ 60 x + y ≥ 10 x ≤ y x ≥ 0, y ≥ 0 Maximize Z = 3x + 9y Minimize Z = 3x + 9y Subject to, x + 3y ≤ 60 x + y ≥ 10 x ≤ y x ≥ 0, y ≥ 0 ∴ Z = 60 is minimum at (5, 5) Also, Z is maximum at two points (15, 15) & (0, 20) ∴ Z = 180 is maximum at all points joining (15, 15) & (0, 20)

Examples

Example 1

Example 2

Example 3 Important You are here

Example 4 Important Deleted for CBSE Board 2022 Exams

Example 5

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.