To solve the problem of determining the optimal product mix to maximize profit, we need to formulate it as a linear programming problem. Here's the step-by-step approach:

1. Define Variables

Let:

• $x$ be the number of units of product X to be produced.
• $y$ be the number of units of product Y to be produced.

2. Objective Function

We want to maximize the total profit. The profit from producing X is Rs. 40 per unit, and the profit from producing Y is Rs. 30 per unit. Therefore, the objective function to maximize is:

$\text{Maximize } Z = 40x + 30y$

3. Constraints

The constraints are based on the production capacities of the facilities.

1. Facility A:
   $100x$ or $150y$
   $\Rightarrow x + \frac{3}{2}y \leq 100$

2. Facility B:
   $80x$ or $80y$
   $\Rightarrow x + y \leq 80$

3. Facility C:
   $100x$ or $200y$
   $\Rightarrow x + 2y \leq 100$

4. Facility D:
   $120x$ or $90y$
   $\Rightarrow 4x + 3y \leq 360$

5. Facility E:
   $60x$ only
   $\Rightarrow x \leq 60$

6. Facility F:
   $60y$ only
   $\Rightarrow y \leq 60$

4. Non-Negativity Constraints

$x \geq 0, \quad y \geq 0$

5. Solution

The problem now is a standard linear programming problem, which can be solved using methods such as the Simplex method, graphical method, or computational tools like Excel Solver.

Let's summarize the problem:

Objective:

$\text{Maximize } Z = 40x + 30y$

Subject to:

1. & \quad x + \frac{3}{2}y \leq 100 \\ 2. & \quad x + y \leq 80 \\ 3. & \quad x + 2y \leq 100 \\ 4. & \quad 4x + 3y \leq 360 \\ 5. & \quad x \leq 60 \\ 6. & \quad y \leq 60 \\ 7. & \quad x \geq 0, \quad y \geq 0 \end{aligned}$$ To find the optimal product mix, we would typically solve this using a linear programming tool. However, based on the constraints, a feasible solution needs to be checked for each constraint intersection, and the profit calculated. The one with the highest profit will be the optimal solution. Do you want me to compute the solution or explore the feasible region graphically?