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: 2/16/2013 2:48:58 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
Test Statistic The next  step is compute an appropriate  test statistic which  is based on an appropriate probability distribution. It  is used to test whether the null  hypo

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

#queSix Operators are to be assigned to five jobs with the cost of assignment in Rs. given in the matrix below. Determine the optimal assignment. Which operator will have no assign

3. 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

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

Meaning of Linear programming problem and explanation of graphical method of solving Linear Programming Problem

which job should proceed first among the 2 jobs on n machines by graphical method

Making Decision Lastly a decision  should  be arrived as to whether the null  hypothesis is  to be accepted  or rejected. In  this regard the value  of the test  statistic

Bibliography Format a. Introduction : Bibliographies  tell  readers  where they can  locate  information  about  a topic. It is a list of sources  of information  for a repo

Problems based on LPP when feasible region is unbounded.     1.    Minimize z = 3x + 5y subject to constraints  X + y ≥ 2 X + 3y ≥ 3 X, y ≥ 0 script