##
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

### Advertisement

### Advertisement