Before You Begin
Question #41695
The Question
Let . A plane in is defined by the equation . A feasible region on is bounded by the non-negativity conditions , , , and the following projection constraints: Determine the maximum value of the objective function for any position vector .
Options
- A.
88
- B.
112
- C.
128
- D.
144
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
Corner Point Method Precision|Line lying in a plane|Unit Vector Normalization|Collinearity and Coplanarity
Why This Question Is Tricky
Common Mistakes
The problem tests the Corner Point Method in 3D, requiring projection to a 2D plane using Unit Vector Normalization.
The lethal trap lies in the coplanarity and collinearity of the constraints.
When projected, the constraint becomes , which is a linear combination of the other boundaries and is entirely redundant.
If a student blindly pairs equations without checking for redundancy or graphing the feasible region, they will intersect with to find a 'ghost' vertex at .
Evaluating the objective function at this invalid vertex yields the trap answer 128, punishing the lack of geometric verification.
Quick Facts About This Question
Question Information
| Subject | Mathematics |
| Chapter | Linear Programming - Class 12 |
| Concept | Corner Point Method Precision |
| Difficulty | 8 |
| Cognitive Load | 7 |
| Target Solve Time | 160 sec |
| Access | Free |