SOLVER7 Study. Nothing Else.
Exercise 12.1 Q10

Show that the minimum of \(Z\) occurs at more than two points.\( Maximise\ Z = x + y, \)
subject to \(x – y \le –1, –x + y \le 0, x, y \ge 0\).

CBSE Class 12 Maths · Linear Programming

Solution

👶 Simple Explanation

Simple Explanation

Imagine two rules: one says you must be taller than your friend, and the other says your friend must be at least as tall as you. Both rules together are impossible to satisfy at the same time. In this problem, one rule says \( y \) must be bigger than \( x \), and another says \( y \) must be smaller than or equal to \( x \). No numbers can obey both rules at once. When rules clash like this, there is no valid answer, and the problem simply has no solution.

Answer: The feasible region is empty because the constraints \( y \ge x + 1 \) and \( y \le x \) cannot hold together. Hence the given LPP has no feasible solution, and \( Z = x + y \) cannot be maximised.

📖 Infeasible LPP: No Feasible Region Exists

Detailed Explanation

In a Linear Programming Problem (LPP), we first draw the constraints and find the feasible region, which is the set of all points satisfying every constraint at once. The objective function \( Z = x + y \) is then optimised (maximised or minimised) at the corner points of this region. But an optimal solution exists only if the feasible region is non-empty. Sometimes the constraints contradict one another, so no point can satisfy all of them together. In that case the feasible region is empty and the LPP has no feasible solution, which means Z cannot be maximised at all.

Formula Used

Objective function: \( Z = x + y \). Constraints: \( x - y \le -1 \), \( -x + y \le 0 \), \( x \ge 0 \), \( y \ge 0 \).

Solution

  1. Step 1: Rewrite each constraint in a clearer form so we can see what region it describes. From \( x - y \le -1 \) we get \( y \ge x + 1 \). From \( -x + y \le 0 \) we get \( y \le x \). We also have \( x \ge 0 \) and \( y \ge 0 \).
  2. Step 2: Combine the two key inequalities. The first says \( y \ge x + 1 \), so y must be at least 1 more than x. The second says \( y \le x \), so y must be at most x. Putting them together requires \[ x + 1 \le y \le x. \]
  3. Step 3: Check whether both can hold at the same time. We would need \( x + 1 \le x \), which simplifies to \[ 1 \le 0. \] This is a false statement, so there is no value of x and y satisfying both constraints simultaneously.
  4. Step 4: Interpret the result graphically. The line \( y = x + 1 \) lies entirely above the line \( y = x \) and never meets it (they are parallel). The region \( y \ge x + 1 \) is above the upper line, while \( y \le x \) is below the lower line. These two regions do not overlap, so no common shaded area exists.
  5. Step 5: Conclude about the feasible region. Since the constraints contradict each other, the feasible region is empty. There are no corner points, so the objective function \( Z = x + y \) has nothing to be evaluated on.

Final Answer

The feasible region is empty because the constraints \( y \ge x + 1 \) and \( y \le x \) cannot hold together. Hence the given LPP has no feasible solution, and \( Z = x + y \) cannot be maximised.

Common Mistake

A common mistake is to draw the lines carelessly and shade some non-empty region anyway, then report a maximum value. Always test whether the constraints are consistent; here \( x + 1 \le y \le x \) leads to \( 1 \le 0 \), proving no feasible point exists.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Rewrite the first structural constraint in slope-intercept form. Starting from \( x - y \le -1 \), rearrange to get \( y \ge x + 1 \). — Reason: A clearer form shows exactly which side of the boundary line the feasible region must lie on.
  2. Step 2: Rewrite the second structural constraint similarly. Starting from \( -x + y \le 0 \), rearrange to get \( y \le x \). — Reason: Expressing both inequalities in terms of \( y \) makes it easy to compare them directly.
  3. Step 3: Place the two inequalities together as a chain. Any point in the feasible region must satisfy both, so we need \[ x + 1 \le y \le x. \] — Reason: A feasible point must obey every constraint at once, so both bounds on \( y \) must hold simultaneously.
  4. Step 4: Check the chain for consistency. The chain \( x + 1 \le y \le x \) requires the left end to be at most the right end, i.e. \( x + 1 \le x \), which simplifies to \[ 1 \le 0. \] — Reason: If the lower bound exceeds the upper bound, no real number \( y \) can satisfy the chain, so we test whether \( x + 1 \le x \) is ever true.
  5. Step 5: Conclude from the contradiction. The statement \( 1 \le 0 \) is always false, regardless of the values of \( x \) and \( y \). — Reason: A universally false inequality means there is no pair \( (x, y) \) that can satisfy both \( y \ge x + 1 \) and \( y \le x \) at the same time.
  6. Step 6: Interpret the result graphically. The line \( y = x + 1 \) lies entirely above the line \( y = x \) (they are parallel, separated by a vertical distance of 1). The constraint \( y \ge x + 1 \) demands points on or above the higher line, while \( y \le x \) demands points on or below the lower line. These two half-planes share no common points. — Reason: A geometric picture confirms the algebraic contradiction: the two required half-planes are disjoint.
  7. Step 7: State the conclusion for the LPP. Because no point \( (x, y) \) with \( x \ge 0 \) and \( y \ge 0 \) can satisfy all four constraints together, the feasible region is empty, and the objective function \( Z = x + y \) has no maximum value. — Reason: An LPP can only be solved when the feasible region is non-empty; an empty feasible region means no solution exists.

Final Answer

The feasible region is empty because the constraints \( y \ge x + 1 \) and \( y \le x \) cannot hold together. Hence the given LPP has no feasible solution, and \( Z = x + y \) cannot be maximised.

Common Mistake

One common mistake: students sometimes try to find corner points by solving the boundary lines as equations and substituting those intersection coordinates into Z, forgetting to first verify that those points actually satisfy all the constraints. Here the lines \( y = x + 1 \) and \( y = x \) are parallel and never intersect, so there are no corner points at all — a check that must be done before attempting any optimisation.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Rewrite constraints: \( x - y \le -1 \Rightarrow y \ge x + 1 \) and \( -x + y \le 0 \Rightarrow y \le x \).
  2. Step 2: Both constraints together require \( x + 1 \le y \le x \), which implies \( x + 1 \le x \).
  3. Step 3: Simplifying: \( 1 \le 0 \), a contradiction. No point \( (x, y) \) satisfies all constraints simultaneously.

Answer: The feasible region is empty because the constraints \( y \ge x + 1 \) and \( y \le x \) cannot hold together. Hence the given LPP has no feasible solution, and \( Z = x + y \) cannot be maximised.

➕ More Examples

More Examples

Example 1

Question: Maximise \( Z = 2x + 3y \) subject to the constraints \( x - y \le -2 \), \( -x + y \le 1 \), \( x \ge 0 \), \( y \ge 0 \). Comment on whether a maximum value exists.

Solution: We first find the feasible region by graphing all constraints. Constraint 1: \( x - y \le -2 \), i.e. \( y \ge x + 2 \). The boundary line is \( y = x + 2 \). Since \( x \ge 0, y \ge 0 \), this line passes through \( (0, 2) \) and \( (-2, 0) \) (but \( x \ge 0 \) so we only use the part with \( x \ge 0 \)). The region satisfying \( y \ge x + 2 \) with \( x \ge 0 \) lies above this line. Constraint 2: \( -x + y \le 1 \), i.e. \( y \le x + 1 \). The boundary line is \( y = x + 1 \). It passes through \( (0, 1) \) and \( (-1, 0) \). With \( x \ge 0 \), the region satisfying \( y \le x + 1 \) lies below or on this line. Now we check whether both constraints can be satisfied simultaneously (with \( x \ge 0, y \ge 0 \)). From Constraint 1: \( y \ge x + 2 \). From Constraint 2: \( y \le x + 1 \). For both to hold: \( x + 2 \le y \le x + 1 \), which requires \( x + 2 \le x + 1 \), i.e. \( 2 \le 1 \). This is a contradiction. Therefore, there is NO point \( (x, y) \) that satisfies all the given constraints simultaneously. The feasible region is empty. Since the feasible region is empty, the Linear Programming Problem has no feasible solution, and hence Z has no maximum value.

Answer: The feasible region is empty. Z = 2x + 3y has no maximum value (the LPP has no feasible solution).

Example 2

Question: Maximise \( Z = 3x + 2y \) subject to the constraints \( -x + y \ge 1 \), \( x - 2y \le 2 \), \( x \ge 0 \), \( y \ge 0 \). Show that Z has no finite maximum.

Solution: We rewrite the constraints in standard form and graph them. Constraint 1: \( -x + y \ge 1 \), i.e. \( y \ge x + 1 \). Boundary line: \( y = x + 1 \), passing through \( (0, 1) \) and \( (-1, 0) \). Since \( x \ge 0 \), the relevant intercept with \( x = 0 \) gives the point \( (0, 1) \). The feasible side is above this line. Constraint 2: \( x - 2y \le 2 \), i.e. \( y \ge \frac{x - 2}{2} \). Boundary line: \( x - 2y = 2 \), i.e. \( y = \frac{x-2}{2} \), passing through \( (2, 0) \) and \( (0, -1) \). The feasible side (with \( y \ge 0 \)) is above or on this line. Finding the corner of the feasible region: we find the intersection of \( y = x + 1 \) and \( x - 2y = 2 \). Substituting \( y = x + 1 \) into \( x - 2y = 2 \): \[ x - 2(x + 1) = 2 \] \[ x - 2x - 2 = 2 \] \[ -x = 4 \] So \( x = -4 \). Since \( x \ge 0 \), this intersection point is not in the feasible region. For \( x \ge 0 \): Constraint 1 requires \( y \ge x + 1 \ge 1 \). At \( x = 0 \): \( y \ge 1 \). Constraint 2 at \( x = 0 \): \( 0 - 2y \le 2 \Rightarrow y \ge -1 \), which is always satisfied when \( y \ge 0 \). So the feasible region is the set of all \( (x, y) \) with \( x \ge 0 \), \( y \ge x + 1 \) (and constraint 2 is automatically satisfied for large \( y \)). The feasible region is unbounded (as \( x \to \infty \) with \( y = x + 1 \), the region extends without bound). Checking Z along the boundary \( y = x + 1 \) with \( x \ge 0 \): \[ Z = 3x + 2(x + 1) = 5x + 2 \] As \( x \to \infty \), \( Z \to \infty \). So Z is unbounded above. The lowest point of the feasible region occurs at \( x = 0 \), \( y = 1 \), giving \( Z = 3(0) + 2(1) = 2 \). Therefore, Z has a minimum value of 2 at the point \( (0, 1) \), but Z has no finite maximum value — it can be made as large as desired within the feasible region.

Answer: Z = 3x + 2y has no finite maximum (Z is unbounded above). The minimum value of Z is 2, attained at (0, 1).

🎯 Try a Similar Question

Try a Similar Question

Question: Minimise \( Z = 2x + 3y \), subject to the constraints \( x - y \ge 2 \), \( -x + y \ge 1 \), and \( x, y \ge 0 \). Examine whether the minimum of \( Z \) exists.

Solution

  1. Step 1: Rewrite the constraints in standard form: The constraints are: Constraint 1: \( x - y \ge 2 \), which can be written as \( y \le x - 2 \). Constraint 2: \( -x + y \ge 1 \), which can be written as \( y \ge x + 1 \). Non-negativity: \( x \ge 0 \), \( y \ge 0 \).
  2. Step 2: Analyse the two key constraints together: From Constraint 1 we need \( y \le x - 2 \), meaning \( y \) must be at most \( x - 2 \). From Constraint 2 we need \( y \ge x + 1 \), meaning \( y \) must be at least \( x + 1 \). For both to hold simultaneously, we would need \( x + 1 \le y \le x - 2 \), which requires \( x + 1 \le x - 2 \), i.e., \( 1 \le -2 \). This is a contradiction.
  3. Step 3: Confirm no feasible point exists: Since \( x + 1 \le x - 2 \) simplifies to \( 1 \le -2 \), which is always false, there is no value of \( x \) (or \( y \)) that can satisfy both constraints at the same time. The feasible region is therefore empty.
  4. Step 4: Conclusion: Because the feasible region is empty, no point \( (x, y) \) satisfies all the given constraints simultaneously. Hence the given LPP has no feasible solution, and \( Z = 2x + 3y \) cannot be minimised.

Answer: The constraints \( y \le x - 2 \) and \( y \ge x + 1 \) cannot hold together for any real values of \( x \) and \( y \). Therefore the feasible region is empty, and the LPP has no feasible solution — \( Z = 2x + 3y \) has no minimum.

Everything you get with Solver7

More questions in Linear Programming