Start Learning Free

Before You Begin

Question #40554

Difficulty: 8/10 | 🟢 Free

The Question

A factory produces three chemicals A,B,A, B, and CC in quantities x,y,x, y, and zz (in kg) respectively, where x,y,z≥0x, y, z \ge 0. The total production must be exactly 1212 kg. Due to safety regulations, the production state (x,y,z)(x,y,z) must satisfy a stability constraint: its perpendicular distance from the plane x−2y+2z=0x - 2y + 2z = 0 cannot exceed 22 units. The profit per kg for chemicals BB and CC are 44 and 33 respectively. The profit per kg for chemical AA is λ\lambda, where λ\lambda is the maximum possible value of ∣z1−z2∣|z_1 - z_2| for complex numbers z1,z2z_1, z_2 satisfying ∣z1∣=2|z_1| = 2 and ∣z2−3−4i∣=1|z_2 - 3 - 4i| = 1. Find the maximum total profit the factory can achieve.

Options

  • A.

    88

  • B.

    72

  • C.

    126

  • D.

    186

Check Your Answer

Correct Answer

Step-by-Step Solution

Explanation

How the Examiner Thinks

Monster

Ultra-high difficulty questions designed to test your limit, stamina, and deep conceptual understanding.

Concepts Behind This Question

Graphical Feasible Region|Word Problem Modeling|Triangle Inequality Mind Games|Distance from point to plane

Why This Question Is Tricky

Common Mistakes

This problem fuses 3D vector geometry with linear programming.

The primary trap lies in the dimensionality reduction: when projecting the 3D feasible region onto the xyxy-plane, students frequently forget that the non-negativity constraint z≥0z \ge 0 translates to a hidden upper bound x+y≤12x+y \le 12.

If this boundary is ignored, optimizing Z=36+5x+yZ = 36 + 5x + y subject only to x+4y≤30x+4y \le 30 and x,y≥0x,y \ge 0 leads to the lethal trap answer of 186 (at x=30,y=0x=30, y=0, where z=−18z=-18).

The complex number triangle inequality acts as an initial rigorous filter to prevent heuristic guessing of the objective function coefficients.

Quick Facts About This Question

Question Information

SubjectMathematics
ChapterLinear Inequalities - Class 11
ConceptGraphical Feasible Region
Difficulty8
Cognitive Load7
Target Solve Time160 sec
AccessFree