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:48:58 AM | Location : USA







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

Medical Industry Payments to Physicians The relationships between physicians and medical related companies in the United States, generally acknowledged to be familiar given th

G. Ambler has € 10000 available for a second hand car, but would like to buy a fast car that costs € 25000. He needs the money for that car quickly, and would like to increase his


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

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 pape

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

Limitation  The  report should  also point  out the  main  limitation of the  research reported  therein. This  will be helpful  to the reader who can form  his own opinion

Question 1 Explain the process of problem identification with an example 2 Interview method involves a dialogue among the Interviewee and the Interviewer. Describe the inter

SOLVE THE FOLLOWING LP USING SIMPLE METHOD MAXIMIZE Z=3X1+2X2 SUBJECT TO CONSTRAINT X1+X2 X1-X2 X1,X2>=0