LPP FORMULATION., 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/31/2013 12:24:51 AM | Location : USA







Related Discussions:- LPP FORMULATION., Assignment Help, Ask Question on LPP FORMULATION., Get Answer, Expert's Help, LPP FORMULATION. Discussions

Write discussion on LPP FORMULATION.
Your posts are moderated
Related Questions
Show simple vapour compression Refrigeration cycle with showing all the devices and also draw T-sand P-R diagram and illustrate it also. A Bell-Coleman cycle works between 1 bar

Davidson construction company is building a luxury lakefront home in batangas coordination of the architech an sub contractors will require a major effort to meet the 44-week (appr

the dual form of the following lpp min z=3x1+2.5x2 constraints:2x1+4x2>=40, 3x1+2x2>=50 and x1,x2>=0

A Company produces 150 cars. But the production rate varies with the distribution. Production Rate Probability 147 0.05 148 0.10 149 0.15 150 0.20 151 0.30 152 0.15 153 0.05 At pre

It can be seen from the optimal solution for the foundry problem that two resources, raw material-1 and labor, are exhausted whereas the other two resources, raw materi

McColvin's Principles: L.R McColvin advanced his Demand and Supply Theory of Book Selection in 1925. He states, "Books in themselves are nothing. They have no more meaning tha

Cost- sampling decisons                         σ x¯ =S/√n       Where is the  standard  error of he mean is the standard devaluation of  the population and n is t

Question: (a) (i) Explain what do you understand by ‘Dynamic Programming'. (ii) Describe the dynamic programming approach to solve the shortest route problem. (iii) Outli

the application areas of linear programming

. 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