Check sibling questions

Ex 12.1, 4 - Chapter 12 Class 12 Linear Programming

Last updated at May 29, 2023 by

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

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

Learn in your speed, with individual attention - Teachoo Maths 1-on-1 Class

Book a free demo

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,

Ask a doubt
Davneet Singh's photo - Co-founder, Teachoo

Made by

Davneet Singh

Davneet Singh has done his B.Tech from Indian Institute of Technology, Kanpur. He has been teaching from the past 13 years. He provides courses for Maths, Science, Social Science, Physics, Chemistry, Computer Science at Teachoo.