Ex 12.1, 8 - Chapter 12 Class 12 Linear Programming

Last updated at April 16, 2024 by

Ex 12.1, 8 - Minimise and Maximise Z = x + 2y - Linear equations given - Bounded

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

Transcript

Ex 12.1, 8 Minimise and Maximise Z = x + 2y subject to x + 2y ≥ 100, 2x – y ≤ 0, 2x + y ≤ 200; x, y ≥ 0. Minimize & Maximize Z = x + 2y Subject to, x + 2y ≥ 100 2x - y ≤ 0 2x + y ≤ 200 x, y, ≥ 0 ∴ Z = 400 is maximum at (0, 200) Also, Z is minimum at two points (0, 50) & (20, 40) ∴ Z = 100 is minimum at all points joining (0, 50) & (20, 40)

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