Ex 12.1, 4 - Minimise Z = 3x + 5y such that x + 3y > 3 - Linear equations given - Unbounded

Slide9.PNG
Slide10.PNG Slide11.PNG

  1. Chapter 12 Class 12 Linear Programming
  2. Serial order wise
Ask Download

Transcript

Ex 12.1, 4 Solve the following Linear Programming Problems graphically: Minimise Z = 3x + 5y such that x + 3y ≥ 3, x + y ≥ 2, x, y ≥ 0. Minimize Z = 3x + 5y Subject to x + 3y ≥ 3 x + y ≥ 2 x ≥ 0, y ≥ 0 As the region that is feasible is unbounded. Hence, 7 may or may not be minimum value of Z. For this we graph inequality,

About the Author

Davneet Singh's photo - Teacher, Computer Engineer, Marketer
Davneet Singh
Davneet Singh is a graduate from Indian Institute of Technology, Kanpur. He has been teaching from the past 7 years. He provides courses for Mathematics and Science from Class 6 to 12. You can learn personally from here https://www.teachoo.com/premium/maths-and-science-classes/.
Jail