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

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

Last updated at Dec. 17, 2018 by

Example 1 - Solve the following linear Maximise Z = 4x + y - Linear equations given - Bounded

Example 1 - Chapter 12 Class 12 Linear Programming - Part 2
Example 1 - Chapter 12 Class 12 Linear Programming - Part 3

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

    3. Examples

    Miscellaneous →

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)

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.