Before You Begin
Question #41682
The Question
Let the feasible region in the -plane be defined by the system of inequalities: Let be the set of all values such that the objective function attains its maximum value on at infinitely many points. Find the value of .
Options
- A.
- B.
- C.
- D.
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
Multiple Optimal Solutions|Objective Function Gradient|Normal Form Parameters
Why This Question Is Tricky
Common Mistakes
This question tests the geometric interpretation of multiple optimal solutions in Linear Programming.
The core principle is that the objective function's gradient must align with the outward normal of a binding constraint for a maximum to occur along an edge.
The primary trap lies in incorrectly identifying the outward normals, particularly for the non-negativity constraints (), where students often mistakenly use the inward normals and yielding .
Another trap is miscalculating the normal form angle for by taking the wrong quadrant (e.g., instead of ).
Quick Facts About This Question
Question Information
| Subject | Mathematics |
| Chapter | Linear Programming - Class 12 |
| Concept | Multiple Optimal Solutions |
| Difficulty | 8 |
| Cognitive Load | 7 |
| Target Solve Time | 160 sec |
| Access | Free |