Detailed Explanation
In Linear Programming, we optimize (maximize or minimize) a linear objective function subject to a set of linear inequalities called constraints. The set of all points satisfying every constraint is called the feasible region. According to the Corner Point Theorem, if an optimal value of the objective function exists, it must occur at one (or more) of the corner points (vertices) of the feasible region. So the graphical method involves: converting each inequality into a line, plotting these lines, shading the region that satisfies all constraints, identifying the corner points, and finally evaluating the objective function at each corner to pick the best value. Here we maximize \( Z = 4500x + 5000y \) subject to \( x + y \le 250 \), \( 25x + 40y \le 7000 \), and \( x \ge 0, \ y \ge 0 \).
Formula Used
Objective function: \( Z = 4500x + 5000y \). Corner Point Method: evaluate \( Z \) at every vertex of the feasible region; the largest value is the maximum.
Solution
- Step 1: Convert each inequality into its boundary line. For \( x + y \le 250 \), the line is \( x + y = 250 \), which meets the axes at \( (250, 0) \) and \( (0, 250) \). For \( 25x + 40y \le 7000 \), the line is \( 25x + 40y = 7000 \), which meets the axes at \( (280, 0) \) and \( (0, 175) \).
- Step 2: Decide the correct side of each line by testing the origin \( (0,0) \). For \( x + y \le 250 \): \( 0 \le 250 \) is true, so we take the side containing the origin. For \( 25x + 40y \le 7000 \): \( 0 \le 7000 \) is true, so again the origin side. With \( x \ge 0 \) and \( y \ge 0 \), the feasible region lies in the first quadrant.
- Step 3: Find the point where the two boundary lines intersect. Solve \( x + y = 250 \) and \( 25x + 40y = 7000 \). From the first, \( x = 250 - y \). Substitute: \[ 25(250 - y) + 40y = 7000 \] \[ 6250 - 25y + 40y = 7000 \] \[ 15y = 750 \] \[ y = 50 \] Then \( x = 250 - 50 = 200 \), giving the intersection point \( (200, 50) \).
- Step 4: Identify the corner points of the feasible region. They are the origin \( (0, 0) \), the point on the x-axis \( (250, 0) \), the intersection point \( (200, 50) \), and the point on the y-axis \( (0, 175) \). Note we use \( (0,175) \), not \( (0,250) \), because \( (0,250) \) violates \( 25x + 40y \le 7000 \).
- Step 5: Evaluate \( Z = 4500x + 5000y \) at each corner point. At \( (0,0) \): \( Z = 0 \). At \( (250, 0) \): \( Z = 4500(250) = 1125000 \). At \( (200, 50) \): \( Z = 4500(200) + 5000(50) = 900000 + 250000 = 1150000 \). At \( (0, 175) \): \( Z = 5000(175) = 875000 \).
- Step 6: Compare all values of \( Z \). The values are \( 0 \), \( 1125000 \), \( 1150000 \), and \( 875000 \). The greatest is \( 1150000 \), which occurs at the corner point \( (200, 50) \). Hence this is the optimal solution.
Final Answer
The maximum value of \( Z \) is \( 1150000 \), attained at \( x = 200 \) and \( y = 50 \).
Common Mistake
A common mistake is taking \( (0, 250) \) as a corner point just because it lies on \( x + y = 250 \). But \( (0, 250) \) does not satisfy \( 25x + 40y \le 7000 \), so it is outside the feasible region. Always verify that each candidate corner point satisfies every constraint before using it.