Detailed Explanation
In Linear Programming, the objective function \( Z = px + qy \) attains its maximum value at a corner (vertex) of the feasible region. Sometimes the maximum occurs not at a single vertex but at every point along an entire edge joining two vertices. This special situation, called multiple (or infinite) optimal solutions, happens only when the two end vertices of that edge give the SAME value of \( Z \). From the image, the feasible region is the polygon with vertices \( O(0,0) \), \( C(5,0) \), \( B(3,4) \) and \( A(0,5) \). Since all points on segment AB give the maximum, the vertices \( A(0,5) \) and \( B(3,4) \) must give equal values of \( Z \).
Formula Used
Objective function: \( Z = px + qy \). Condition for the whole edge AB to be optimal: value of \( Z \) at \( A \) equals value of \( Z \) at \( B \), i.e. \( Z_A = Z_B \).
Solution
- Step 1: Read the vertices from the graph: From the diagram, the feasible region ABCO has the corner points \( A(0,5) \), \( B(3,4) \), \( C(5,0) \) and \( O(0,0) \). The maximum of \( Z \) is stated to occur at every point of the segment AB.
- Step 2: Understand what 'all points on AB give max Z' means: If \( Z \) were maximum at only one vertex, that vertex would be unique. But here every point of edge AB is optimal. This is possible only when both endpoints of AB give the same maximum value. Therefore we set the value of \( Z \) at \( A \) equal to the value of \( Z \) at \( B \).
- Step 3: Compute Z at vertex A: Substitute \( A(0,5) \) into \( Z = px + qy \). \[ Z_A = p(0) + q(5) = 5q \]
- Step 4: Compute Z at vertex B: Substitute \( B(3,4) \) into \( Z = px + qy \). \[ Z_B = p(3) + q(4) = 3p + 4q \]
- Step 5: Equate the two values: Since AB is entirely optimal, set \( Z_A = Z_B \). \[ 5q = 3p + 4q \]
- Step 6: Solve for the relation: Simplify the equation. \[ 5q - 4q = 3p \] \[ q = 3p \]
Final Answer
The correct relation is \( q = 3p \), which is option (C).
Common Mistake
A common mistake is to equate the wrong pair of vertices (for example \( B \) and \( C \)) or to write \( Z = px + qy \) with the coordinates swapped, giving \( p = 3q \). Always match \( p \) with the x-coordinate and \( q \) with the y-coordinate, and equate the two endpoints of the specific segment stated to be optimal (here A and B).