A paper mill products two grade of paper viz., X & Y. Because of raw material restriction, it cannot produce more than 400 tons of grade X paper & 300 tons of grade Y paper in a week. There are 160 production hours in week. It requires 0.20 & 0.40 hours to produce a ton of grade X & Y papers. The mill earns profits of Rs.200 & Rs.500 per ton of Grade X & Y paper respectively. Formulate this as a Linear Programming Problem.

Posted Date: 2/20/2013 6:46:18 AM | Location : USA

Ask an Expert

Related Discussions:- Answer, Assignment Help, Ask Question on Answer, Get Answer, Expert's Help, Answer Discussions

Write discussion on Answer
Your posts are moderated

Write your message here..

Related Questions

Applications of statistics in management, In a business, statis... In a business, statistics is used to study the demand and market characteristics of the product or service being sold. In fact, market research

Game theory, if there were n workers and n jobs there would be if there were n workers and n jobs there would be

Linear programming, A PAPER MILL PRODUCES TWO GRADES OF PAPER VIZ., X AND Y... A PAPER MILL PRODUCES TWO GRADES OF PAPER VIZ., X AND Y. BECAUSE OF RAW MATERIAL RESTRICTIONS, IT CANNOT PRODUCE MORE THAN 400 TONS OF GRADE X PAPER AND 300 TONS OF GRADE Y PAPER I

Mip, procedure of mip procedure of mip

Linear programming, maximize z=3x1+2x2 subgect to the constraints x1+x2 x1-... maximize z=3x1+2x2 subgect to the constraints x1+x2 x1-x2 x1,x2>_0

Mba , in a rectangular game pay off matrix of player a is as follows ... in a rectangular game pay off matrix of player a is as follows B1 B2 A1 5 7 A2 4 0 salve the game write down the pay off matrix of B and then solve the ga

Linear programming, #questiA paper mill produces two grades of paper viz X ... #questiA paper mill produces two grades of paper viz X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y pa

Simple method, Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 4 X... Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 4 X1+ X2 2 X1, X2 0on..

Characteristics of good average, Characteristics  of Good Average a. ... Characteristics  of Good Average a. It should  be Rigidly  Defined  An average should  be rigidly defined so that  there is  no confusion  in regard  to its  meaning  and con

Dynamic programming problems, Maximize z=3x+7y subject to constraint x+4y x... Maximize z=3x+7y subject to constraint x+4y x,y>=0