Detailed Explanation
In Linear Programming, we optimize (maximize or minimize) a linear function called the objective function, here \( Z = 13x - 15y \), subject to a set of linear inequalities called constraints. The set of all points satisfying every constraint is called the feasible region. A key theorem states that the optimal value of the objective function, if it exists on a bounded feasible region, always occurs at one of the corner points (vertices) of that region. So the strategy is: draw the boundary lines of each constraint, shade the region satisfying all inequalities, locate every corner point, and evaluate \( Z \) at each corner. The largest value gives the maximum.
Formula Used
Corner Point Method: Evaluate the objective function \( Z = 13x - 15y \) at every corner point of the feasible region, and choose the point that gives the maximum value of \( Z \).
Solution
- Step 1: Write down the constraints clearly. We must maximize \( Z = 13x - 15y \) subject to \( x + y \le 7 \), \( 2x - 3y + 6 \ge 0 \), \( x \ge 0 \), and \( y \ge 0 \). The conditions \( x \ge 0 \) and \( y \ge 0 \) restrict us to the first quadrant.
- Step 2: Convert each inequality into its boundary line. For \( x + y \le 7 \), the line is \( x + y = 7 \), which passes through \( (7, 0) \) and \( (0, 7) \). For \( 2x - 3y + 6 \ge 0 \), the line is \( 2x - 3y + 6 = 0 \), which passes through \( (-3, 0) \) and \( (0, 2) \).
- Step 3: Decide which side of each line to shade using the test point \( (0, 0) \). For \( x + y \le 7 \): substituting gives \( 0 \le 7 \), which is true, so shade the side containing the origin. For \( 2x - 3y + 6 \ge 0 \): substituting gives \( 6 \ge 0 \), which is true, so again shade the side containing the origin. Combined with \( x \ge 0 \) and \( y \ge 0 \), the feasible region lies in the first quadrant on the origin side of both lines.
- Step 4: Find the corner points of the feasible region. Start with the axis points. The origin \( (0, 0) \) satisfies all constraints. On the y-axis, the line \( 2x - 3y + 6 = 0 \) meets it at \( (0, 2) \). On the x-axis, the line \( x + y = 7 \) meets it at \( (7, 0) \).
- Step 5: Find the intersection of the two slanted lines. Solve \( x + y = 7 \) and \( 2x - 3y + 6 = 0 \) together. From the first, \( x = 7 - y \). Substituting: \[ 2(7 - y) - 3y + 6 = 0 \] \[ 14 - 2y - 3y + 6 = 0 \] \[ 20 - 5y = 0 \] So \( y = 4 \) and \( x = 7 - 4 = 3 \). The intersection point is \( (3, 4) \).
- Step 6: List all corner points of the feasible region: \( (0, 0) \), \( (7, 0) \), \( (3, 4) \), and \( (0, 2) \). These form the vertices of the bounded feasible region.
- Step 7: Evaluate \( Z = 13x - 15y \) at each corner point. At \( (0, 0) \): \( Z = 13(0) - 15(0) = 0 \). At \( (7, 0) \): \( Z = 13(7) - 15(0) = 91 \). At \( (3, 4) \): \( Z = 13(3) - 15(4) = 39 - 60 = -21 \). At \( (0, 2) \): \( Z = 13(0) - 15(2) = -30 \).
- Step 8: Compare the values: \( 0 \), \( 91 \), \( -21 \), and \( -30 \). The largest value is \( 91 \), which occurs at the point \( (7, 0) \).
Final Answer
The maximum value of \( Z \) is \( 91 \), attained at the corner point \( (7, 0) \), that is, at \( x = 7 \) and \( y = 0 \).
Common Mistake
A very common error is to shade the wrong side of the line \( 2x - 3y + 6 \ge 0 \). Students often assume it excludes the origin, but testing \( (0, 0) \) gives \( 6 \ge 0 \), which is true, so the origin IS in the feasible region. Another frequent mistake is forgetting to check the corner point \( (0, 0) \) or evaluating \( Z \) at only some vertices instead of all of them.