linear programming, Operation Research

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 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/26/2013 6:50:08 AM | Location :







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

Write discussion on linear programming
Your posts are moderated
Related Questions
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


Small Sample The central limit  theorem does not work well  with small  samples  even if  the  population  in non Gaussian. So  we cannot  rely on the central limit theorem

Steps of Research Process The steps of research process have already been discussed in theory. Here we shall outline the procedure of conducting the research. i) Formulate t

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

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

Why Two regression Lines Once regression line  cannot  minimize the sum  of square of deviations  for both  the x and Y series  unless the relationship  between  them  indicat

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

factors affecting tha transportation cost

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