ExamBro
ExamBro
COMEDK · Maths · 35. Linear Programming

Laksmi wants to buy few bangles and ear drops. Each bangle costs ₹\( 5\) and each ear drop costs ₹\( 10\). She should buy atleast 6 bangles and atmost 2 ear drops. If she buys \(x\) bangles and \(y\) ear drops with minimum expenditure, then the formulation for this linear programming is

  1. A Maximize \(5 x+10 y\) subject to \(x \geq 6, y \leq 2, x\), \(y \geq 0\).
  2. B Minimise \(5 x+10 y\) subject to \(x \geq 6, y \leq 2, x, y \geq 0\).
  3. C Maximise \(x+y\) subject to \(5 x+10 y \leq 50, x, y \geq 0\).
  4. D Maximise \(6 x+2 y\) subject to \(5 x+10 y \leq 50, x\), \(y \geq 0\).
Verified Solution

Answer & Solution

Correct Answer

(B) Minimise \(5 x+10 y\) subject to \(x \geq 6, y \leq 2, x, y \geq 0\).

Step-by-step Solution

Detailed explanation

Minimise \(5 x+10 y\) Subject to \(x \geq 6\) \(y \leq 2\) \(x, y \geq 0\)