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

Example 5 - Chapter 12 Class 12 Linear Programming

Last updated at Sept. 24, 2018 by

Example 5 - Minimise Z = 3x + 2y subject constraints:x + y< 8 - Linear equations given - Not feasible

Slide16.PNG

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

    3. Examples

    Miscellaneous →
Ask Download

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 maximum value of Z

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.