1. Chapter 12 Class 12 Linear Programming
  2. Serial order wise
  3. Examples

Example 3 - Chapter 12 Class 12 Linear Programming

Last updated at June 15, 2018 by

Example 3 - Minimise and Maximise Z = 3x + 9y - Linear equations given - Bounded

Slide8.PNG
Slide9.PNG

  1. Chapter 12 Class 12 Linear Programming
  2. Serial order wise
    3. Examples
    Miscellaneous →
Ask Download

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 ≥ y, 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)

Chapter 12 Class 12 Linear Programming
Serial order wise

About the Author

Davneet Singh's photo - Teacher, Computer Engineer, Marketer
Davneet Singh
Davneet Singh is a graduate from Indian Institute of Technology, Kanpur. He has been teaching from the past 8 years. He provides courses for Maths and Science at Teachoo. You can check his NCERT Solutions from Class 6 to 12.