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: 1/31/2013 9:13:19 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

Discuss the methodology of 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 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

Sources of Hypothesis Hypothesis  may be developed from  various  sources. Some  of the important  sources are  the  followings: 1. A Hypothesis  Arises from  Intuition

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

Assignments should be submitted via FLO by the above deadline. Penalties for late submission are as set out in the topic SAM on FLO. Extensions can be granted in line with standard

Teesside Construction is developing a schedule for a major building project to start in 04/01/2011 in Middlesbrough, UK. The project manager has identified major activities of the

Books: Books form  one of the primary sources of information. They provide a cohesively organised (thought content) information on a specific subject of optimum depth. Since b

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