What would you like to understand?

The linking constraint $X_i \le C_i Y_i$ enforces the on/off production rule by scaling the capacity limit $C_i$ with the binary activation variable $Y_i$. When the machine is active ($Y_i=1$), the constraint becomes $X_i \le C_i$, allowing production up to the full capacity.

Conditions: $X_i$ is the production quantity on machine $i$.; $Y_i$ is the binary activation indicator for machine $i$.; $C_i$ is the maximum capacity of machine $i$.; $X_i \ge 0$ is enforced.

The linking constraint $X_i \le C_i Y_i$ enforces the on/off production rule by scaling the capacity limit $C_i$ with the binary activation variable $Y_i$. When the machine is active ($Y_i=1$), the constraint becomes $X_i \le C_i$, allowing production up to the full capacity.

Conditions: $X_i$ is the production quantity on machine $i$.; $Y_i$ is the binary activation indicator for machine $i$.; $C_i$ is the maximum capacity of machine $i$.; $X_i \ge 0$ is enforced.

The optimal solution uses machines 2 and 3, while machine 1 remains unused. The production quantities are $X_1=0$, $X_2=550$, and $X_3=450$.

Conditions: The model includes three machines with specific costs and capacities.; The demand is exactly 1000 units.; The objective is to minimize total cost.; The solution is derived from solving the integer linear program.

The optimal solution uses machines 2 and 3, while machine 1 remains unused. The production quantities are $X_1=0$, $X_2=550$, and $X_3=450$.

Conditions: The model includes three machines with specific costs and capacities.; The demand is exactly 1000 units.; The objective is to minimize total cost.; The solution is derived from solving the integer linear program.