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 8:28:20 AM | 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
write the scope of operation research

Sample Survey Methods: If proposed investigation is done  only on  a part taken  out of  universe then it  will be  known  as sample  survey. This  part of the universe is kno

On the  Basis  of Ratio of Change  Direction   a. Linear Correlation: The  correlation  between  two variables a said  to be liner if  corresponding  to a unit change in th

Considerations for Oral Reporting Sometimes  the researcher has been asked to  make an oral presentation of his  research findings he should  bear in mind a few major  conside

undertake the proposed research investigation in accordance with the agreed specification and procedures

Uses of Range a.Range is suitable  measure  of dispersion  when the  data are too  scattered to justify the  computation of a more precise  measure of dispersion. b.In rece

1) Provide an overall description of the business and the competitive environment in which it operates.  You should describe: a) what type of business it  is (e.g. retail, manuf

Question A - Linear Programming is most widely used technique for large number of applications in business industry as well as in various other fields. Describe in brief the steps

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

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