Example 1 - Chapter 12 Class 12 Linear Programming

Last updated at Feb. 24, 2025 by

Slide129.JPG

Slide130.JPG
Slide131.JPG

Share on WhatsApp

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 - Co-founder, Teachoo

Made by

Davneet Singh

Davneet Singh has done his B.Tech from Indian Institute of Technology, Kanpur. He has been teaching from the past 15 years. He provides courses for Maths, Science and Computer Science at Teachoo