1. Chapter 12 Class 12 Linear Programming (Term 1)
  2. Concept wise
  3. Linear equations given - Bounded

Ex 12.1, 1 - Chapter 12 Class 12 Linear Programming (Term 1)

Last updated at Dec. 11, 2021 by

Slide132.JPG

Slide133.JPG
Slide134.JPG

  1. Chapter 12 Class 12 Linear Programming (Term 1)
  2. Concept wise

    3. Linear equations given - Bounded

    Linear equations given - Not feasible →

Transcript

Ex 12.1, 1 Solve the following Linear Programming Problems graphically: Maximize Z = 3x + 4y subject to the constraints : x + y ≤ 4, x ≥ 0, y ≥ 0. Maximize Z = 3x + 4y Subject to, x + y ≤ 4 x ≥ 0, y ≥ 0 x + y ≤ 4 Hence, Z is maximum at (0, 4) Maximum value is 16

Chapter 12 Class 12 Linear Programming (Term 1)
Concept wise

About the Author

Davneet Singh's photo - Teacher, Engineer, Marketer
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.