SOLVER7 Study. Nothing Else.
2026 Board Paper Q31

The corner points of the feasible region determined by the system of linear constraints in an \(LPP\) are \((0, 10), (5, 5), (15, 15)\) and \((0, 20).\) Let \(Z = px + qy, \ p, q > 0,\) be the objective function, then find the relation between \(p\) and \(q\) so that the maximum of \(Z\) occurs at both the points \((15, 15)\) and \((0, 20).\)

CBSE Class 12 Maths · Linear Programming

Solution

👶 Simple Explanation

Simple Explanation

Imagine two friends scoring the same marks on a test using different questions. If both scores are equal, you can figure out how the marks were set up. Here, two special corner points of a graph give the same highest value. Setting those two equal values together lets us find a hidden rule linking \( p \) and \( q \). After cancelling common numbers, the rule turns out to be beautifully simple.

Answer: The required relation is \( q = 3p \) (equivalently \( 3p = q \)).

📖 Maximum of Z at Two Corner Points

Detailed Explanation

In a Linear Programming Problem (LPP), the optimal (maximum or minimum) value of the objective function \( Z = px + qy \) always occurs at one of the corner points of the feasible region. This is called the Corner Point Method. Sometimes the maximum value can occur at more than one corner point at the same time. When this happens, it means the value of \( Z \) at those points is equal. So, if the maximum occurs at two corner points, we simply set the value of \( Z \) at one point equal to the value of \( Z \) at the other point, and simplify to get a relation between \( p \) and \( q \).

Formula Used

Objective function: \( Z = px + qy \). Condition for the maximum to occur at two points \( A \) and \( B \): \( Z(A) = Z(B) \).

Solution

  1. Step 1: Write down the objective function and the two corner points where the maximum is said to occur. Here \( Z = px + qy \) with \( p, q > 0 \), and the two points are \( (15, 15) \) and \( (0, 20) \).
  2. Step 2: Find the value of \( Z \) at the point \( (15, 15) \) by substituting \( x = 15 \) and \( y = 15 \). \[ Z_{1} = p(15) + q(15) = 15p + 15q \]
  3. Step 3: Find the value of \( Z \) at the point \( (0, 20) \) by substituting \( x = 0 \) and \( y = 20 \). \[ Z_{2} = p(0) + q(20) = 20q \]
  4. Step 4: Since the maximum of \( Z \) occurs at both points, the values of \( Z \) at these points must be equal. So set \( Z_{1} = Z_{2} \). \[ 15p + 15q = 20q \]
  5. Step 5: Simplify the equation to find the relation between \( p \) and \( q \). \[ 15p = 20q - 15q \] \[ 15p = 5q \] \[ q = 3p \]

Final Answer

The required relation is \( q = 3p \) (equivalently \( 3p = q \)).

Common Mistake

A common mistake is to check the condition using non-optimal corner points, or to substitute the coordinates incorrectly. Remember to equate \( Z \) only at the two given points where the maximum occurs and to keep \( x \) and \( y \) in the correct positions when computing \( px + qy \).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the objective function and the two corner points where the maximum is said to occur. The objective function is \( Z = px + qy \) with \( p, q > 0 \), and the two corner points are \( (15, 15) \) and \( (0, 20) \). — Reason: We need to know which points and which function to work with before doing any calculations.
  2. Step 2: Substitute \( x = 15 \) and \( y = 15 \) into the objective function to evaluate \( Z \) at the first corner point: \[ Z_1 = p(15) + q(15) = 15p + 15q \] — Reason: We compute the value of \( Z \) at the first point so we can compare it with the value at the second point.
  3. Step 3: Substitute \( x = 0 \) and \( y = 20 \) into the objective function to evaluate \( Z \) at the second corner point: \[ Z_2 = p(0) + q(20) = 20q \] — Reason: We compute the value of \( Z \) at the second point so that both values are ready to be compared.
  4. Step 4: Since the maximum of \( Z \) occurs at both corner points, both values must be equal. Set \( Z_1 = Z_2 \): \[ 15p + 15q = 20q \] — Reason: When two corner points give the same maximum, the objective function values at those points are identical; equating them is the key condition.
  5. Step 5: Rearrange the equation by moving all terms involving \( q \) to one side: \[ 15p = 20q - 15q \] which simplifies to \[ 15p = 5q \] — Reason: Collecting like terms isolates the relationship between \( p \) and \( q \).
  6. Step 6: Divide both sides of \( 15p = 5q \) by \( 5 \): \[ 3p = q \] — Reason: Dividing by the common factor \( 5 \) gives the simplest form of the relation between \( p \) and \( q \).

Final Answer

The required relation is \( q = 3p \) (equivalently \( 3p = q \)).

Common Mistake

One common mistake: Students sometimes set up the condition as \( Z_1 > Z_2 \) or \( Z_1 < Z_2 \) instead of \( Z_1 = Z_2 \). When the maximum occurs at two corner points simultaneously, the values must be exactly equal — not just one greater than the other.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Given: \ Z = px + qy \ attains maximum at both \ (15, 15) \ and \ (0, 20).
  2. Step 2: Set \ Z(15,15) = Z(0,20) \: \ \ \ \ \ 15p + 15q = 20q
  3. Step 3: \ 15p = 20q - 15q = 5q \ so \ 3p = q \.

Answer: The required relation is \( q = 3p \) (equivalently \( 3p = q \)).

➕ More Examples

More Examples

Example 1

Question: The corner points of the feasible region of an LPP are \((0, 8)\), \((4, 6)\), \((12, 12)\), and \((0, 15)\). The objective function is \(Z = px + qy\) where \(p, q > 0\). Find the relation between \(p\) and \(q\) so that the maximum of \(Z\) occurs at both \((12, 12)\) and \((0, 15)\).

Solution: Step 1: Evaluate Z at the two points where the maximum is required to occur simultaneously. At \((12, 12)\): \[Z_1 = 12p + 12q\] At \((0, 15)\): \[Z_2 = 0 \cdot p + 15q = 15q\] Step 2: For the maximum to occur at both points, set \(Z_1 = Z_2\): \[12p + 12q = 15q\] Step 3: Simplify. \[12p = 15q - 12q\] \[12p = 3q\] \[\frac{p}{q} = \frac{3}{12} = \frac{1}{4}\] So the required relation is \(4p = q\), i.e. \(q = 4p\). Step 4: Verify that this value does not make Z larger at other corner points. Using \(q = 4p\): At \((0, 8)\): \(Z = 0 + 8(4p) = 32p\) At \((4, 6)\): \(Z = 4p + 6(4p) = 4p + 24p = 28p\) At \((12, 12)\): \(Z = 12p + 12(4p) = 12p + 48p = 60p\) At \((0, 15)\): \(Z = 0 + 15(4p) = 60p\) Since \(60p > 32p\) and \(60p > 28p\) for \(p > 0\), the maximum indeed occurs at both \((12, 12)\) and \((0, 15)\).

Answer: \(q = 4p\)

Example 2

Question: The corner points of the feasible region of an LPP are \((0, 5)\), \((3, 4)\), \((10, 10)\), and \((0, 18)\). The objective function is \(Z = px + qy\) where \(p, q > 0\). Find the relation between \(p\) and \(q\) so that the maximum of \(Z\) occurs at both \((10, 10)\) and \((0, 18)\).

Solution: Step 1: Evaluate Z at the two points where the maximum is required to occur simultaneously. At \((10, 10)\): \[Z_1 = 10p + 10q\] At \((0, 18)\): \[Z_2 = 0 \cdot p + 18q = 18q\] Step 2: For the maximum to occur at both points, set \(Z_1 = Z_2\): \[10p + 10q = 18q\] Step 3: Simplify. \[10p = 18q - 10q\] \[10p = 8q\] \[\frac{p}{q} = \frac{8}{10} = \frac{4}{5}\] So the required relation is \(5p = 4q\). Step 4: Verify that this value does not make Z larger at other corner points. Using \(5p = 4q\), so \(q = \frac{5p}{4}\): At \((0, 5)\): \(Z = 0 + 5 \cdot \frac{5p}{4} = \frac{25p}{4}\) At \((3, 4)\): \(Z = 3p + 4 \cdot \frac{5p}{4} = 3p + 5p = 8p\) At \((10, 10)\): \(Z = 10p + 10 \cdot \frac{5p}{4} = 10p + \frac{50p}{4} = 10p + 12.5p = 22.5p = \frac{45p}{4}\) At \((0, 18)\): \(Z = 0 + 18 \cdot \frac{5p}{4} = \frac{90p}{4} = \frac{45p}{4}\) Since \(\frac{45p}{4} > \frac{25p}{4}\) and \(\frac{45p}{4} > 8p = \frac{32p}{4}\) for \(p > 0\), the maximum indeed occurs at both \((10, 10)\) and \((0, 18)\).

Answer: \(5p = 4q\)

🎯 Try a Similar Question

Try a Similar Question

Question: The corner points of the feasible region of an LPP are \( (0, 8) \), \( (4, 6) \), \( (12, 12) \), and \( (0, 15) \). The objective function is \( Z = px + qy \), where \( p, q > 0 \). Find the relationship between \( p \) and \( q \) so that the maximum of \( Z \) occurs at both \( (12, 12) \) and \( (0, 15) \).

Solution

  1. Step 1: Write Z at the two given points: Since the maximum of Z occurs at both \( (12, 12) \) and \( (0, 15) \), the value of Z must be equal at these two points. At \( (12, 12) \): \[ Z_1 = p(12) + q(12) = 12p + 12q \] At \( (0, 15) \): \[ Z_2 = p(0) + q(15) = 15q \]
  2. Step 2: Set the two values equal: For the maximum to occur at both points, we need \( Z_1 = Z_2 \). So: \[ 12p + 12q = 15q \]
  3. Step 3: Simplify the equation: Subtracting \( 12q \) from both sides: \[ 12p = 15q - 12q \] which gives \[ 12p = 3q \]
  4. Step 4: Find the required relation: Dividing both sides by 3: \[ 4p = q \] So the required relationship is \( q = 4p \).
  5. Step 5: Verify the maximum is indeed at these two points: Substituting \( q = 4p \) into Z, compute Z at all four corner points. At \( (0, 8) \): \[ Z = p(0) + 4p(8) = 32p \] At \( (4, 6) \): \[ Z = p(4) + 4p(6) = 4p + 24p = 28p \] At \( (12, 12) \): \[ Z = p(12) + 4p(12) = 12p + 48p = 60p \] At \( (0, 15) \): \[ Z = p(0) + 4p(15) = 60p \] Since \( p > 0 \), the value \( 60p \) is indeed the largest, and it occurs at both \( (12, 12) \) and \( (0, 15) \). This confirms the relation \( q = 4p \).

Answer: The required relation is \( q = 4p \) (equivalently \( 4p = q \)).

Everything you get with Solver7

More questions in Linear Programming