A furniture trader deals in only two items- chairs and tables. He has Rs. 50,000 to invest and a space to store at most 35 items. A chair costs him Rs. 1000 and a table costs him Rs. 2000. The trader earns a profit of Rs. 150 and Rs. 250 on a chair and a table, respectively. Choose the correct option among following that describes the given linear programming problem (LPP) to maximize the profit (where x and y are the number of chairs and tables that trader buys and sells)?
Answer & explanation
Correct answer: option 2
The correct answer is Option (2) → Maximize \(Z = 150x + 250y\), Subject to constraints, \(x + y \le 35, x + 2y \le 50, x \ge 0, y \ge 0\)
Let the trader buy and sell x chairs and y tables. The profit to be maximised is
\(Z = 150x + 250y\)
Investment: the cost can be at most Rs. 50,000:
\(1000x + 2000y \le 50000\)
\(x + 2y \le 50\) (dividing by 1000)
Storage: at most 35 items:
\(x + y \le 35\)
The numbers of items cannot be negative: \(x \ge 0, y \ge 0\).
Why the other options are incorrect
Option (1) Maximize \(Z = 150x + 250y\), Subject to constraints, \(x + y \le 35, x + 2y \ge 50, x \ge 0, y \ge 0\) — Incorrect. The money available is an upper limit, so the investment constraint is \(x + 2y \le 50\), not \(\ge\).
Option (3) Maximize \(Z = 150x + 250y\), Subject to constraints, \(x + y \ge 35, 2x + y \le 50, x \ge 0, y \ge 0\) — Incorrect. The storage limit needs \(x + y \le 35\), and \(2x + y\) swaps the costs of a chair and a table.
Option (4) Maximize \(Z = 150x + 250y\), Subject to constraints, \(x + y \ge 35, 2x + y \ge 50, x \ge 0, y \ge 0\) — Incorrect. Both inequalities point the wrong way, and \(2x + y\) swaps the costs.