linear programming problem, 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/8/2013 7:57:34 AM | Location : USA







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

Write discussion on linear programming problem
Your posts are moderated
Related Questions
max z 60x1+50x2 Sab to 4x1+10x2 2x1+2x2 3x1+2x2 X1+x2. >_ o

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

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

Data Management As your  research project progresses you will  quickly  gather more  and more  data. These need  to be managed in such  a way that they  can be  accesses and

QUESTION a) "Organizations have to change only because changes in their external environments force them to change." Discuss b) What restraining forces may block the impleme

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

CONSTRUCTION PROCEDURE The construction of an interview schedule or questionnaire is a time consuming task requiring considerable attention to all the details. The investig

Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

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 ot grade Y paper in

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