A manufacturer produces nuts and bolts for industrial machinery. It takes 1 hour of work on machine A and 3 hours on machine B to produce a package of nuts, while it takes 3 hours on machine A and 1 hour on machine B to produce a package of bolts. He earns a profit of Rs. 2.50 per package of nuts and Rs. 1 per package of bolts. If he makes x packages of nuts and y packages of bolts and operates each machine for at most 12 hours a day, the linear programming problem to maximise his profit is
Answer & explanation
Correct answer: option 3
The correct answer is Option (3) → Maximise \(Z = 2.5x + y\) subject to \(x + 3y \le 12\), \(3x + y \le 12\), \(x \ge 0\), \(y \ge 0\)
Let x packages of nuts and y packages of bolts be made. The objective function is the profit:
\(Z = 2.5x + y\)
Machine A works 1 hour for each package of nuts and 3 hours for each package of bolts, for at most 12 hours:
\(x + 3y \le 12\)
Machine B works 3 hours for each package of nuts and 1 hour for each package of bolts, for at most 12 hours:
\(3x + y \le 12\)
The numbers of packages cannot be negative, so \(x \ge 0,\ y \ge 0\).
Why the other options are incorrect
Option (1) Maximise \(Z = 2.5x + y\) subject to \(x + 3y \le 24\), \(3x + y \le 24\), \(x \ge 0\), \(y \ge 0\) — Incorrect. Each machine works at most 12 hours, not 24.
Option (2) Maximise \(Z = x + 2.5y\) subject to \(x + 3y \le 12\), \(3x + y \le 12\), \(x \ge 0\), \(y \ge 0\) — Incorrect. The profit of Rs. 2.50 is on nuts (x), not on bolts (y).
Option (4) Maximise \(Z = 2.5x + y\) subject to \(x + 3y \ge 12\), \(3x + y \ge 12\), \(x \ge 0\), \(y \ge 0\) — Incorrect. “At most 12 hours” gives \(\le\), not \(\ge\).