A linear programming problem is as follows:
𝑀𝑖𝑛𝑖𝑚𝑖𝑧𝑒 𝑍 = 30𝑥 + 50𝑦
subject to the constraints,
3𝑥 + 5𝑦 ≥ 15
2𝑥 + 3𝑦 ≤ 18
𝑥 ≥ 0,𝑦 ≥ 0
In the feasible region, the minimum value of Z occurs at
(a) a unique point (b) no point
(c) infinitely many points (d) two points only
![Slide2.JPG](https://d1avenlh0i1xmr.cloudfront.net/5da2dd17-ede5-47d6-95af-725fd4a7c957/slide2.jpg)
![Slide3.JPG](https://d1avenlh0i1xmr.cloudfront.net/4f0e062e-549d-4ccc-8788-20e2508c9e2e/slide3.jpg)
![Slide4.JPG](https://d1avenlh0i1xmr.cloudfront.net/85fc79f0-1fa3-4b40-b686-0401acb35266/slide4.jpg)
![Slide5.JPG](https://d1avenlh0i1xmr.cloudfront.net/3ba3e885-dd39-44be-8796-345db4443c86/slide5.jpg)