1. Chapter 12 Class 12 Linear Programming
  2. Serial order wise
  3. Ex 12.1

Ex 12.1, 8 - Chapter 12 Class 12 Linear Programming

Last updated at June 15, 2018 by

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

Slide23.PNG
Slide24.PNG

Subscribe to our Youtube Channel - https://you.tube/teachoo

  1. Chapter 12 Class 12 Linear Programming
  2. Serial order wise

    3. Ex 12.1

    Ex 12.2 →

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)

Chapter 12 Class 12 Linear Programming
Serial order wise

About the Author

Davneet Singh's photo - Teacher, Computer Engineer, Marketer
Davneet Singh
Davneet Singh is a graduate from Indian Institute of Technology, Kanpur. He has been teaching from the past 9 years. He provides courses for Maths and Science at Teachoo.