1. Chapter 12 Class 12 Linear Programming (Term 1)
  2. Serial order wise
  3. Ex 12.1

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

Last updated at Feb. 17, 2020 by

Ex 12.1, 5 - Maximise Z = 3x + 2y subject to x + 2y < 10

Ex 12.1, 5 - Chapter 12 Class 12 Linear Programming - Part 2
Ex 12.1, 5 - Chapter 12 Class 12 Linear Programming - Part 3

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

    3. Ex 12.1

    Ex 12.2 →

Transcript

Ex 12.1, 5 Solve the following Linear Programming Problems graphically: Maximise Z = 3x + 2y subject to x + 2y ≤ 10, 3x + y ≤ 15, x, y ≥ 0. Maximize Z = 3x + 2y Subject to, x + 2y ≤ 10 3x + y ≤ 15 x , y ≥ 0 ∴ Z = 18 is maximum at (4, 3)

Chapter 12 Class 12 Linear Programming (Term 1)
Serial order 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.