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
application area of linear programing problem

Case Study - Research Design RJR Nabisco Ever since the health aspects  of smoking  became  a public  issue  shortly after world war II the tobacco industry knew there

Inability of NIH, FDA, to Identify Conflict of Interest While federal regulations require that researchers receiving NIH grants remain free of financial conflicts of interest,

1. We have looked at a number of theories explaining the nature of the relationship between media producers and audiences. Give a detailed description of at least three of these ap

Individual User Interests: More specific information about users could cover the following:  Subjects and associated interest - e.g. specific subjects, allied subjects;

b. 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 pape

Ask 7:23 PM Docx Reader GROUP-7 1. A firm manufactures two products A & B on which the profits earned per unit is Rs.3 and Rs.4. Each product is processed on two machines Miand M2.

You are a manager at a medium sized manufacturing operation that sells a customized product directly to the consumers and the data pattern is linear but it can have the occasion ra

#questionthe following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0 ..

scope of operation research\