A brick manufacturer has two depots A and B , with stocks of 30000 and 20000 bricks…

Mathematics · Class 12 · CBSELinear Programming

A brick manufacturer has two depots A and B, with stocks of 30000 and 20000 bricks respectively. He receives orders from three builders P, Q and R for 15000, 20000 and 15000 bricks respectively. The cost (in `) of transporting 1000 bricks to the builders from the depots are as given in the table :

The manufacturer wishes to find how to fulfil the order so that transportation cost is minimum. Formulate the LPP.
  1. Minimize Z = 40x – 20y
    Subject to, x + y 15, x + y ≤ 30, x 15, y ≤ 20, x 0, y 0
  2. Minimize Z = 40x – 20y
    Subject to, x + y 15, x + y ≤ 30, x ≤ 15, y 20, x 0, y 0
  3. Minimize Z = 40x – 20y
    Subject to, x + y 15, x + y ≤ 30, x ≤ 15, y ≤ 20, x 0, y 0
  4. Minimize Z = 40x – 20y
    Subject to, x + y 15, x + y ≤ 30, x 15, y 20, x 0, y 0

Answer

(C) Minimize Z = 40 x – 20 y Subject to, x + y ≥ 15, x + y ≤ 30, x ≤ 15, y ≤ 20, x ≥ 0, y ≥ 0

Sign up free on Edukali to view the step-by-step worked solution and practice thousands of similar questions.

Related practice questions

More Linear Programming questions · Browse all practice questions