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
#questioA 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

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

Importance of Normal Distribution Normal distribution  plays  a very  important  role in  statistical  theory  and in  particular  in sampling theory. It has  been  found  th


Edwards Life Sciences is trying to decide if it should sell a new type of medical product. Fixed costs associated to the production of the product are estimated to be $30,000. Th

Choose a publicly traded company (NYSE, AMX, or OTC) that interests you. If you don't know how to choose a company, think of IBM, DELL computer, Nike, Apple computer, GM, Ford, Nok

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

Area under Standard Normal Curve The graph  of the  standard  normal  curve y = p(z) with  different percentages areas is  shown here. Since p(z) is  a probability  distributi

find optimal solution for a 3*4 matrix 42 27 24 35 46 37 32 32 40 40 30 35 using modi method

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