LPP, Operation Research

#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 in a week. There are 160 production hours in a week. It requires 0.20 and 0.40 hours to produce a ton of grade X and Y papers. The mill earns a profit of Rs. 200 and Rs. 500 per ton of grade X and Y paper respectively. Formulate this as a Linear Programming Problem...
Posted Date: 1/25/2013 11:28:09 PM | Location : USA







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

Write discussion on LPP
Your posts are moderated
Related Questions
Ask question #Minimum 100 words acceptNas food produces to kinds of popular dark chocolate bars. the banana and coffee. the banana bar costs 0.22 to make and sells of 0.35, where a

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

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 we

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4


The town of Silverton, Colorado, has three gasoline stations, Shell, Exxon, and Arco. Customer selection of service stations can be modeled as a Markov process, with the following

Discuss the methodology of operation research

Usage in the Context of Library and Information Services: In library and information science, there is, however, no need for making such distinction between data and informati

Analysis of Available Information and Verification of Hypothesis: most of the time that a scientist spends in training is devoted to learning how to analyze and int

. Explain in brief the phases of Operations Research. 5 +5 = 10 marks (200 - 250 words each) Q3. Solve the following Linear Programming Problem using Simple method. Maximize Z= 3