Ex 12.1, 2 - Chapter 12 Class 12 Linear Programming

Last updated at Dec. 16, 2024 by

Ex 12.1, 2 - Minimise Z = -3x + 4y subject to x + 2y < 8 - Linear equations given - Bounded

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

Go Ad-free

Transcript

Ex 12.1, 2 Solve the following Linear Programming Problems graphically: Minimise Z = – 3x + 4 y subject to x + 2y ≤ 8, 3x + 2y ≤ 12, x ≥ 0, y ≥ 0. Minimize Z = −3x + 4y Subject to x + 2y ≤ 8 3x + 2y ≤ 12 x ≥ 0, y ≥ 0 Hence, Z = –12 is minimum at (4, 0)

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 14 years. He provides courses for Maths, Science and Computer Science at Teachoo