![Ex 12.1, 4 - Chapter 12 Class 12 Linear Programming - Part 2](https://d1avenlh0i1xmr.cloudfront.net/408b27cc-3dc8-4db6-b602-4e31c1153ee5/slide9.png)
![Ex 12.1, 4 - Chapter 12 Class 12 Linear Programming - Part 3](https://d1avenlh0i1xmr.cloudfront.net/8ae3233c-8560-4e03-996d-72b96ee915b1/slide10.png)
![Ex 12.1, 4 - Chapter 12 Class 12 Linear Programming - Part 4](https://d1avenlh0i1xmr.cloudfront.net/9f2b57dd-b202-468f-8d25-ef4dd0203393/slide11.png)
Last updated at April 16, 2024 by Teachoo
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,