You are here
Example 1 - Chapter 12 Class 12 Linear Programming
Last updated at Dec. 16, 2024 by Teachoo
You saved atleast 2 minutes by viewing the ad-free version of this page. Thank you for being a part of Teachoo Black.
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)
