Answer:
An example of a linear (integer) programming problem
Step-by-step explanation:
We infer the following:
Let the number of mugs produced by machine 1 be represented by X,
Since only one machine is to be used in the week of Christmas, this constraints should apply for machine-1;
Constraints
Production cost≤ $2,
Service Incurred cost≤$100,
Production capacity (excluding sunday) ≥ 800 mugs served,
Objective Function
Minimise cost: XService cost + XProduction cost
Minimise: 100x + 20x