Start Learning Free

Before You Begin

Question #41682

Difficulty: 8/10 | 🟢 Free

The Question

Let the feasible region RR in the xyxy-plane be defined by the system of inequalities: x≥0,y≥0x \ge 0, \quad y \ge 0 x−y≤2x - y \le 2 x+3y≤6x + \sqrt{3}y \le 6 Let SS be the set of all values θ∈[0,2π)\theta \in [0, 2\pi) such that the objective function Z=xcos⁡θ+ysin⁡θZ = x \cos \theta + y \sin \theta attains its maximum value on RR at infinitely many points. Find the value of ∑θ∈Sθ\sum_{\theta \in S} \theta.

Options

  • A.

    55π12\frac{55\pi}{12}

  • B.

    43π12\frac{43\pi}{12}

  • C.

    31π12\frac{31\pi}{12}

  • D.

    19π12\frac{19\pi}{12}

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 (x≥0,y≥0x \ge 0, y \ge 0), where students often mistakenly use the inward normals (1,0)(1,0) and (0,1)(0,1) yielding θ=0,π/2\theta=0, \pi/2.

Another trap is miscalculating the normal form angle for x−y≤2x - y \le 2 by taking the wrong quadrant (e.g., 3π/43\pi/4 instead of 7π/47\pi/4).

Quick Facts About This Question

Question Information

SubjectMathematics
ChapterLinear Programming - Class 12
ConceptMultiple Optimal Solutions
Difficulty8
Cognitive Load7
Target Solve Time160 sec
AccessFree