Start Learning Free

Before You Begin

Question #41691

Difficulty: 8/10 | 🟢 Free

The Question

Let A={(x,y)∈R2:3x+4y≤25,  4x+3y≤25,  x+y≤7,  0≤x≤6,  0≤y≤6}A = \{ (x,y) \in \mathbb{R}^2 : 3x + 4y \le 25, \; 4x + 3y \le 25, \; x + y \le 7, \; 0 \le x \le 6, \; 0 \le y \le 6 \}. Let f:A→Bf: A \to B be a surjective function defined by f(x,y)=7x+7y+5f(x,y) = 7x + 7y + 5. Which of the following intervals represents the set BB?

Options

  • A.

    [5,54][5, 54]

  • B.

    [5,55][5, 55]

  • C.

    [5,47][5, 47]

  • D.

    [5,1483]\left[5, \frac{148}{3}\right]

Check Your Answer

Correct Answer

Step-by-Step Solution

Explanation

How the Examiner Thinks

Specialist

Targeted practice for niche, high-difficulty concepts that frequently appear in JEE Advanced exams.

Concepts Behind This Question

Redundant Constraints|Surjective Mapping (Onto)|Domain Restrictions

Why This Question Is Tricky

Common Mistakes

The trap exploits the student's tendency to assume that the intersection of the two 'most complex' constraints (3x+4y≤253x+4y \le 25 and 4x+3y≤254x+3y \le 25) automatically forms the optimal vertex of the feasible region.

Because 50/7≈7.1450/7 \approx 7.14 is very close to 7, students might hastily conclude that x+y≤7x+y \le 7 is a redundant constraint and ignore it.

By doing so, they calculate the maximum at (25/7,25/7)(25/7, 25/7), yielding an incorrect upper bound of 55.

This tests the rigorous verification of all constraints and the understanding that seemingly redundant constraints can actively truncate the feasible region and restrict the codomain of a surjective mapping.

Quick Facts About This Question

Question Information

SubjectMathematics
ChapterLinear Programming - Class 12
ConceptRedundant Constraints
Difficulty8
Cognitive Load7
Target Solve Time160 sec
AccessFree