Check sibling questions

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

Last updated at Dec. 11, 2021 by

Slide129.JPG

Slide130.JPG
Slide131.JPG

Transcript

Example 1 Solve the following linear programming problem graphically: Maximise Z = 4x + y subject to the constraints: x + y ≤ 50 3x + y ≤ 90 x ≥ 0, y ≥ 0 Maximize Z = 4x + y Subject to x + y ≤ 50 3x + y ≤ 90 x ≥ 0, y ≥ 0 ∴ Z is maximum at (30, 0)

Davneet Singh's photo - Teacher, Engineer, Marketer

Made by

Davneet Singh

Davneet Singh is a graduate from Indian Institute of Technology, Kanpur. He has been teaching from the past 12 years. He provides courses for Maths and Science at Teachoo.