Example 1 - Chapter 12 Class 12 Linear Programming (Term 1)
Last updated at Dec. 17, 2018 by Teachoo
Last updated at Dec. 17, 2018 by Teachoo
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 Corner Points Value of Z (0, 50) 50 (20, 30) 110 (30, 0) 120 (0, 0) 0 ∴ Z is minimum at (30, 0)
Linear equations given - Bounded
About the Author