![Example 4 - Chapter 12 Class 12 Linear Programming - Part 2](https://d1avenlh0i1xmr.cloudfront.net/f5b4d01f-948d-46c4-963c-de91e201851b/slide11.jpg)
![Example 4 - Chapter 12 Class 12 Linear Programming - Part 3](https://d1avenlh0i1xmr.cloudfront.net/830cfc6d-2290-4750-85a8-c707bdc2fbd6/slide12.jpg)
![Example 4 - Chapter 12 Class 12 Linear Programming - Part 4](https://d1avenlh0i1xmr.cloudfront.net/db1fb7ad-f70b-488b-8c86-27fe10f66693/slide13.jpg)
![Example 4 - Chapter 12 Class 12 Linear Programming - Part 5](https://d1avenlh0i1xmr.cloudfront.net/4c9e056a-86be-4bf6-8280-947095f3dac6/slide14.jpg)
Examples
Last updated at April 16, 2024 by Teachoo
Example 4 Determine graphically the minimum value of the objective function Z = – 50x + 20y. Subject to the constraints: 2x – y ≥ – 5 3x + y ≥ 3 2x – 3y ≤ 12 x ≥ 0, y ≥ 0 Minimum Z = −50x + 20y Subject to, 2x – y ≥ – 5 3x + y ≥ 3 2x – 3y ≤ 12 x ≥ 0, y ≥ 0 As the region that is feasible is unbounded. Hence -300 may or may not be the minimum value of Z. To check this, we graph inequality. As, there are some common points between the feasible region & the inequality. Hence, 300 is not the minimum value of Z. ∴ Z has no minimum value