Before You Begin
Question #40531
The Question
Consider the linear programming problem: Minimize subject to the constraints: The minimum value of is:
Options
- A.
820
- B.
410
- C.
0
- D.
\text{Does not exist}
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
Denominator Restriction|Objective Function Gradient|Non-Negativity Restriction|Sign Flipping Rule
Why This Question Is Tricky
Common Mistakes
This question tests the 'Sign Flipping Rule' and 'Denominator Restriction' in rational inequalities within an LPP context.
Students commonly cross-multiply without considering the sign of the variable denominator, incorrectly yielding the constraints and .
This flawed logic produces a false feasible region with a minimum at , leading to the trap answer of 820.
However, properly splitting the inequalities into cases based on the sign of reveals contradictory conditions (e.g., and implying , which contradicts the case assumption ).
Consequently, the actual feasible region is an empty set, meaning no minimum exists.
Quick Facts About This Question
Question Information
| Subject | Mathematics |
| Chapter | Linear Inequalities - Class 11 |
| Concept | Denominator Restriction |
| Difficulty | 8 |
| Cognitive Load | 7 |
| Target Solve Time | 160 sec |
| Access | Free |