(A), (C) and (D) only
(A) and (D) only
The objective is to minimize \( Z = -50x + 20y \) subject to the following constraints:
The process involves defining the feasible region and then determining the minimum value of \( Z \).
Graph each constraint to identify the feasible region.
The feasible region is the area where all these constraints intersect.
The graph indicates that the feasible region extends infinitely in the positive \( y \)-direction and to the right, meaning it is unbounded.
The vertices are found by solving the systems of equations formed by the constraint boundaries:
| Intersection of Lines | Coordinates of Vertex |
|---|---|
| \(2x-y=-5\) and \(3x+y=3\) | \((1,0)\) |
| \(3x+y=3\) and \(2x-3y=12\) | \((3, -6)\) |
| \(2x-y=-5\) and \(y=\frac{2}{3}x-4\) | \((0,5)\) |
(A) The feasible region is unbounded.
(B) Due to the unbounded nature of the feasible region, \( Z = -50x + 20y \) can approach negative infinity as \( x \) increases indefinitely. Therefore, no minimum value exists.
(C) The value of \( Z \) at vertex \((0,5)\) is 100. This is not the minimum value.
(D) A value of -300 can be attained if \( x \) and \( y \) tend towards infinity in a manner that further decreases \( Z \).
The conclusions that are correct are (A), (C), and (D).