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/13/2013 4:05:52 AM | Location :







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
User Groups: The next step would be to identify more specifically the potential user groups. This may be done on the basis of interviews, questionnaires, study of organisation

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

Research Project I will assign a project for your class. The following description is an example of such a project. I may select the following company, may select a different c

Consider the following network where the value on each arc represents the capacity of that arc. Use the augmenting path algorithm to find the value of the maximum flow from node 1

Secondary Periodicals: Secondary Periodicals Secondary periodicals are  abstracting and indexing periodicals.  They are also called documentation periodicals. They are a  syst

Z-Test Prof. Fisher has  given a method  of testing the significance of the correlation coefficient in small  samples. According  to this method the  coefficient of correlation


Task1:- A company is currently involved in negotiation with its union on the upcoming wage contract. Positive signs in the table represent wage increase while negative sign represe

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

discuss the seauencing decision problem for n jobs on two and three machines