A brick manufacture has two depots A and B, with stocks of 30000 and 20000 bricks respectively. He receive orders form three builders P, Q and R for 15000, 20,000 and 15000 bricks respectively. The cost (in) of transporting 1000 bricks to the builders form the deposits as given in the table. To From Transportation cost per 1000 bricks (in Rs.) P Q R A 40 20 20 B 20 60 40 The manufacturer wished to find how to fulfill the order so that transportation cost is minimum. Formulation of the L.P.P., is given as

• A. Minimize \[Z=40x-20y\] Subject to, \[x+y\ge 15,x+y\le 30,x\ge 15,y\le 20,\]\[x\ge 0,y\ge 0\]
• B. Minimize \[Z=40x-20y\] Subject to, \[x+y\ge 15,x+y\le 30,x\le 15,y\ge 20,\]\[x\ge 0,y\ge 0\]
• C. Minimize \[Z=40x-20y\] Subject to, \[x+y\ge 15,x+y\le 30,x\le 15,y\le 20,\]\[x\ge 0,y\ge 0\]
• D. Minimize \[Z=40x-20y\] Subject to, \[x\ge 0,y\ge 0\]