SOLVER7 Study. Nothing Else.
2026 Board Paper Q15

In the graph, the feasible region representing the Linear Programming Problem for maximising objective function \(Z= px + qy, p, q>0\) is shaded. If all points on segment AB give max (Z), then which of the following is true ? (A)\(p = 2q\) (B)\(p = 3q\) (C)\(q = 3p \) (D)\(q = 2p \)

CBSE Class 12 Maths · Linear Programming

Solution

👶 Simple Explanation

Simple Explanation

Imagine a treasure map where two special spots, A and B, both hold the exact same amount of gold. The treasure formula uses two secret numbers, p and q. Because both spots give equal treasure, we can write a simple equation. Point A is at (0, 5) and point B is at (3, 4). Setting the treasure equal at both spots forces q to be exactly 3 times p. So the hidden rule linking p and q is \( q = 3p \).

Answer: The correct relation is \( q = 3p \), which is option (C).

📖 Optimal Solution Along a Segment in LPP

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

  1. 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.
  2. 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 \).
  3. Step 3: Compute Z at vertex A: Substitute \( A(0,5) \) into \( Z = px + qy \). \[ Z_A = p(0) + q(5) = 5q \]
  4. Step 4: Compute Z at vertex B: Substitute \( B(3,4) \) into \( Z = px + qy \). \[ Z_B = p(3) + q(4) = 3p + 4q \]
  5. Step 5: Equate the two values: Since AB is entirely optimal, set \( Z_A = Z_B \). \[ 5q = 3p + 4q \]
  6. 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).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the corner points of the feasible region from the graph. The feasible region ABCO has vertices \( A(0, 5) \), \( B(3, 4) \), \( C(5, 0) \), and \( O(0, 0) \). — Reason: Corner points are the only candidates where the objective function can attain its maximum or minimum in a linear programme.
  2. Step 2: Interpret the condition that every point on segment AB gives the maximum value of \( Z \). This means neither endpoint alone is the unique maximiser; both \( A \) and \( B \) give the same maximum. — Reason: For a linear objective function, a whole edge is optimal if and only if both endpoints give equal values; otherwise the maximum would be at a single vertex.
  3. Step 3: Evaluate \( Z \) at vertex \( A(0, 5) \). Substituting \( x = 0 \) and \( y = 5 \) into \( Z = px + qy \): \[ Z_A = p(0) + q(5) = 5q \] — Reason: Plugging the coordinates of \( A \) into the objective function gives the value of \( Z \) at that corner.
  4. Step 4: Evaluate \( Z \) at vertex \( B(3, 4) \). Substituting \( x = 3 \) and \( y = 4 \) into \( Z = px + qy \): \[ Z_B = p(3) + q(4) = 3p + 4q \] — Reason: Plugging the coordinates of \( B \) into the objective function gives the value of \( Z \) at that corner.
  5. Step 5: Set \( Z_A = Z_B \) and solve for the relationship between \( p \) and \( q \). \[ 5q = 3p + 4q \] Subtract \( 4q \) from both sides: \[ 5q - 4q = 3p \] Therefore: \[ q = 3p \] — Reason: Equating the two expressions forces the condition that both endpoints are equally optimal, which is exactly what the problem states.
  6. Step 6: Verify the result makes sense. With \( q = 3p \), choose \( p = 1 \) and \( q = 3 \). Then \( Z_A = 5(3) = 15 \) and \( Z_B = 3(1) + 4(3) = 3 + 12 = 15 \). Both match, confirming the condition is satisfied. — Reason: A quick check guards against arithmetic errors and confirms the relation is correct.

Final Answer

The correct relation is \( q = 3p \), which is option (C).

Common Mistake

One common mistake: Students sometimes set up the equation as \( Z_A = Z_B \) but forget to simplify \( 5q = 3p + 4q \) correctly, mistakenly writing \( q = 3p + 4q \) by not subtracting \( 4q \) from both sides, which leads to an incorrect relation.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Corner points: \( A(0,5) \), \( B(3,4) \). Maximum of \( Z = px + qy \) occurs at every point on segment AB, so \( Z_A = Z_B \).
  2. Step 2: \( Z_A = p(0) + q(5) = 5q \) and \( Z_B = p(3) + q(4) = 3p + 4q \).
  3. Step 3: Setting \( Z_A = Z_B \): \( 5q = 3p + 4q \), giving \( q = 3p \).

Answer: The correct relation is \( q = 3p \), which is option (C).

➕ More Examples

More Examples

Example 1

Question: The feasible region of a Linear Programming Problem for maximising the objective function \( Z = ax + by,\; a, b > 0 \) is a polygon. The corner points of the feasible region include \( A(1, 3) \) and \( B(3, 1) \). If every point on segment \( AB \) gives the same maximum value of \( Z \), which of the following is true? (A) \( a = b \) (B) \( a = 2b \) (C) \( b = 2a \) (D) \( 2a = 3b \)

Solution: Step 1: Understand the condition. If every point on segment \( AB \) gives the maximum value of \( Z \), then \( Z \) is constant along \( AB \). This means the line \( ax + by = k \) (for the maximum value \( k \)) is exactly the line passing through \( A(1,3) \) and \( B(3,1) \). Step 2: Find the slope of segment \( AB \). \[ m_{AB} = \frac{1 - 3}{3 - 1} = \frac{-2}{2} = -1 \] Step 3: Find the slope of the level curve of \( Z \). The level curve is \( ax + by = k \), so \( y = -\dfrac{a}{b}x + \dfrac{k}{b} \). The slope is \( -\dfrac{a}{b} \). Step 4: Equate the slopes. \[ -\frac{a}{b} = -1 \] \[ \frac{a}{b} = 1 \] Therefore \( a = b \). Step 5: Verify by substituting both points into \( Z = ax + by \) with \( a = b \). At \( A(1,3) \): \( Z = a(1) + a(3) = 4a \). At \( B(3,1) \): \( Z = a(3) + a(1) = 4a \). Both give the same value, confirming \( a = b \).

Answer: (A) \( a = b \)

Example 2

Question: In the feasible region of a Linear Programming Problem for maximising \( Z = mx + ny,\; m, n > 0 \), two corner points are \( P(2, 6) \) and \( Q(6, 2) \). It is observed that every point on segment \( PQ \) gives the maximum value of \( Z \). Which of the following is necessarily true? (A) \( m = 3n \) (B) \( n = 3m \) (C) \( m = n \) (D) \( 2m = n \)

Solution: Step 1: State the condition for all points on \( PQ \) to give maximum \( Z \). The level curve \( mx + ny = k \) must coincide with segment \( PQ \). So the slope of the level curve must equal the slope of \( PQ \). Step 2: Find the slope of \( PQ \). \[ m_{PQ} = \frac{2 - 6}{6 - 2} = \frac{-4}{4} = -1 \] Step 3: Find the slope of the level curve \( mx + ny = k \). Rearranging: \( y = -\dfrac{m}{n}x + \dfrac{k}{n} \). Slope \( = -\dfrac{m}{n} \). Step 4: Equate slopes. \[ -\frac{m}{n} = -1 \] \[ m = n \] Step 5: Verify. With \( m = n \), at \( P(2,6) \): \( Z = m(2) + m(6) = 8m \). At \( Q(6,2) \): \( Z = m(6) + m(2) = 8m \). Both are equal, confirming \( m = n \).

Answer: (C) \( m = n \)

🎯 Try a Similar Question

Try a Similar Question

Question: In a Linear Programming Problem, the objective function is \( Z = px + qy \) where \( p, q > 0 \). The feasible region (shaded) has corner points at \( A(0, 6) \), \( B(4, 2) \), \( C(6, 0) \), and \( D(0, 0) \). If every point on the segment AB gives the maximum value of \( Z \), which of the following relations between \( p \) and \( q \) is correct? (A) \( p = q \) (B) \( p = 2q \) (C) \( 2p = q \) (D) \( 3p = 2q \)

Solution

  1. Step 1: Identify the coordinates of A and B: The segment AB joins \( A(0, 6) \) and \( B(4, 2) \).
  2. Step 2: Find the slope of segment AB: Slope of AB is calculated as: \[ m = \frac{2 - 6}{4 - 0} = \frac{-4}{4} = -1 \]
  3. Step 3: Find the slope of the objective function line: Rewrite \( Z = px + qy \) as \( qy = -px + Z \), giving \[ y = -\frac{p}{q}x + \frac{Z}{q} \] So the slope of the objective function line is \( -\dfrac{p}{q} \).
  4. Step 4: Apply the condition for all points on AB to give the same Z: If every point on segment AB maximises \( Z \), the iso-profit line \( Z = px + qy \) must be parallel to AB. Therefore their slopes must be equal: \[ -\frac{p}{q} = -1 \] This gives \[ \frac{p}{q} = 1 \] Hence \( p = q \).
  5. Step 5: Verify by computing Z at A and B: At \( A(0, 6) \): \( Z = p(0) + q(6) = 6q \). At \( B(4, 2) \): \( Z = p(4) + q(2) = 4p + 2q \). For both to be equal: \[ 6q = 4p + 2q \] This simplifies to \[ 4q = 4p \] So \( p = q \), confirming our answer. The correct option is (A).

Answer: The correct relation is \( p = q \), which is option (A).

Everything you get with Solver7

More questions in Linear Programming