Operation Research, 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/11/2013 11:32:12 PM | Location : USA







Related Discussions:- Operation Research, Assignment Help, Ask Question on Operation Research, Get Answer, Expert's Help, Operation Research Discussions

Write discussion on Operation Research
Your posts are moderated
Related Questions
identify a new technological innovation not yet commercialized (e.g., house cleaning robotic). What are the product''s features? In your paper, explain how that technological innov

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

Ask question #Minimum 100 words acceptNas food produces to kinds of popular dark chocolate bars. the banana and coffee. the banana bar costs 0.22 to make and sells of 0.35, where a

factors affecting tha transportation cost

The influence of daily life of keeping dogs Part a) Qualitative data analysis: These activities are aimed at developing skills in basic qualitative data analysis Inte

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

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

Select one of the topics listed 1-6 below and outline a programme of quantitative research for its investigation.  The assignment  should cover issues of sample design, instrumen

In the judgement phase due care must be given to define correctly the frame of references of the operation. Objectives and values, whether economic social or aesthetic shoul

Q3. 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