A linear programming problem is as follows: Minimize 30x + 50y subject to the constraints, 3x + 5y ≥ 15 2x + 3y ≤ 18 x ≥ 0, y ≥ 0 In the feasible region, the minimum value of Z occurs at

Options

A. a Unique Point
B. no point
C. infinite many point
D. two point only

Answer

C

Explanation

[#XII_RD_30_E01_27(i)]


since minumum occurs at `2` points, it may be occurs on all points joining `(0,3)` and `(5,0)`


[#XII_RD_30_E01_27(ii)]


since, `z` is minimum on all points on `3x+5y=15`. Thus, `z` is minimum on infinitely many points