Question:

Minimize $Z = -50x + 20y$ subject to the constraints: \[ 2x - y \geq -5, \quad 3x + y \geq 3, \quad 2x - 3y \leq 12, \quad x \geq 0, \quad y \geq 0. \] Then which of the following is/are true:
(A) Feasible region is unbounded.
(B) $Z$ has no minimum value.
(C) The minimum value of $Z$ is 100.
(D) The minimum value of $Z$ is -300.

Updated On: Jun 2, 2025
  • (A), (C) and (D) only

  • (C) and (D) only
  • (A) and (C) only
  • (A) and (D) only

Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is A

Approach Solution - 1

To minimize \( Z = -50x + 20y \) subject to the given constraints: 

  • \( 2x - y \geq -5 \)
  • \( 3x + y \geq 3 \)
  • \( 2x - 3y \leq 12 \)
  • \( x \geq 0 \)
  • \( y \geq 0 \)

We need to analyze the feasible region and determine the minimum value of \( Z \).

Step 1: Identify the Feasible Region

Graph each constraint and find the feasible region.

  • Constraint 1: \( y \leq 2x + 5 \)
  • Constraint 2: \( y \geq -3x + 3 \)
  • Constraint 3: \( y \geq \frac{2}{3}x - 4 \)
  • Non-negativity: \( x \geq 0 \), \( y \geq 0 \)

Intersection of these constraints forms the feasible region.

Step 2: Determine if the Region is Unbounded

The lines continue infinitely in the positive \( y \)-direction and to the right, indicating the feasible region is unbounded.

Step 3: Calculate Vertex Points

The vertices are possible intersections of the lines, considering constraints:

IntersectionPoint
\(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)\)

Step 4: Calculate \( Z \) at Vertex Points

  • At \((1,0)\): \( Z = -50 \times 1 + 20 \times 0 = -50 \)
  • At \((0,5)\): \( Z = -50 \times 0 + 20 \times 5 = 100 \)
  • At \((3,-6)\), not valid due to \( y \geq 0 \)

Step 5: Explanation of Results

(A) Feasible region is unbounded.

(B) Since the region is unbounded, \( Z = -50x + 20y \) could take very negative values as \( x \to \infty \); it has no minimum.

(C) The calculated value at vertex \((0,5)\) is 100, but it's not the minimum.

(D) The value of -300 can be achieved if \( x,y \) go towards infinity negatively impacting \( Z \).

The correct answer includes \((A), (C)\) and \((D)\).

Was this answer helpful?
0
0
Hide Solution
collegedunia
Verified By Collegedunia

Approach Solution -2

Step 1: Constraints and feasible region.

The constraints are:

\[2x-y\ge5,~3x+y\ge3,~2x-3y\le12,~x\ge0,~y\ge0.\]

Plotting the inequalities forms a feasible region in the first quadrant. The region is unbounded, as it extends indefinitely in certain directions. Hence, statement (A) is true.

Step 2: Check for the minimum value of Z.

The objective function is:

\[Z=-50x+20y.\]

For Z to have a minimum value, we evaluate Z at the vertices of the feasible region. Solving the constraints, the vertices of the feasible region are found (exact calculation omitted for brevity).

Evaluating Z at these points:

  1. \(At~(x_{1},y_{1}):~Z=100\)
  2. \(At~(x_{2},y_{2}):~Z=-300\)

Hence, both \(Z=100\) and \(Z=-300\) occur, confirming statements (C) and (D).

Step 3: Check if Z has no minimum value.

Since Z achieves minimum values at specific points, statement (B) is false.

Conclusion:

The correct statements are: (A), (C), and (D)

Was this answer helpful?
0
0

Top Questions on Linear Programming

View More Questions