Check sibling questions

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

Last updated at Dec. 17, 2018 by

Example 5 - Minimise Z = 3x + 2y subject constraints:x + y< 8 - Linear equations given - Not feasible

Example 5 - Chapter 12 Class 12 Linear Programming - Part 2

Are ads bothering you?

Join Teachoo Black

Transcript

Example 5 - Chapter 2 Class 12 Linear Programming - NCERT Minimise Z = 3x + 2y subject to the constraints: x + y ≥ 8 3x + 5y ≤ 15 x ≥ 0, y ≥ 0 Plotting points For x + y ≥ 8 Points are (0, 8) and (8, 0) For 3x + 5y ≤ 15 Points are (0, 3) and (5, 0) Plotting graphs of both lines And shading the relevant parts We notice that There is no common region, thus, there is no feasible region. Hence, there is no maxnimum value of Z

Davneet Singh's photo - Teacher, Engineer, Marketer

Made by

Davneet Singh

Davneet Singh is a graduate from Indian Institute of Technology, Kanpur. He has been teaching from the past 12 years. He provides courses for Maths and Science at Teachoo.