![Ex 12.1, 2 - Chapter 12 Class 12 Linear Programming - Part 2](https://d1avenlh0i1xmr.cloudfront.net/ebedcd57-8ac5-4dac-be42-857ec0f1fad0/slide4.png)
![Ex 12.1, 2 - Chapter 12 Class 12 Linear Programming - Part 3](https://d1avenlh0i1xmr.cloudfront.net/3214a750-909e-4bfd-bb63-c07f68019d4a/slide5.png)
Last updated at April 16, 2024 by Teachoo
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)