Before You Begin
Question #41676
The Question
Let be the feasible region in the -plane defined by the inequalities: Find the maximum value of the objective function on the region .
Options
- A.
10
- B.
12
- C.
- D.
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
Unbounded Region Trap|Corner Point Method Precision|Right-Hand vs Left-Hand Derivatives
Why This Question Is Tricky
Common Mistakes
This question tests the rigorous application of Linear Programming principles, specifically targeting the blind use of the Corner Point Method.
Students frequently identify the vertices of a feasible region, evaluate the objective function, and declare the highest value as the maximum.
Here, the region is a semi-infinite strip.
The lower boundary has a non-differentiable cusp at where the Left-Hand Derivative is -2 and the Right-Hand Derivative is 2.
Because the slope of the objective function () exceeds the RHD of the boundary, the level curves of intersect the unbounded ray at increasingly larger values.
The student is trapped into choosing at the cusp, failing to realize the region is unbounded in a direction that allows .
Quick Facts About This Question
Question Information
| Subject | Mathematics |
| Chapter | Linear Programming - Class 12 |
| Concept | Unbounded Region Trap |
| Difficulty | 8 |
| Cognitive Load | 7 |
| Target Solve Time | 160 sec |
| Access | Free |