1. Chapter 12 Class 12 Linear Programming (Term 1)
  2. Concept wise
  3. Linear equations given - Unbounded

Ex 12.1, 4 - Chapter 12 Class 12 Linear Programming (Term 1)

Last updated at May 29, 2018 by

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

Advertisement

Ex 12.1, 4 - Chapter 12 Class 12 Linear Programming - Part 2

Advertisement

Ex 12.1, 4 - Chapter 12 Class 12 Linear Programming - Part 3 Ex 12.1, 4 - Chapter 12 Class 12 Linear Programming - Part 4

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

    3. Linear equations given - Unbounded

    Diet problems →

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,

Chapter 12 Class 12 Linear Programming (Term 1)
Concept 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.