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/15/2013 5:15:26 AM | Location : USA

Ask an Expert

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

Write discussion on MB0048
Your posts are moderated

Write your message here..

Related Questions

LINEAR PROGRAMMING, Meaning of Linear programming problem and explanation o... Meaning of Linear programming problem and explanation of graphical method of solving Linear Programming Problem

Operation reaserch, A paper mill produces two grades of paper viz., X and 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

One sample sign test - hypothesis testing , One Sample sign Test In... One Sample sign Test In a one  sample  test the  null  hypothesis μ = μ 0 against an  appropriate alternative on the basis of a random sample of size n we replace each sam

Regression line - correlation regression analysis, Regression Line The... Regression Line The line  of regression  is the  line  which give the best  estimate  to the  values  of one  variable  for any  specific  values  of other  variable. For t

Inflation, Inflation Inflation is a general... Inflation Inflation is a general increase in the price of goods and services. The inflation rate, as measured by the

Linear programming problem, A paper mill produces two grades of paper viz.,... 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

Dynamic programming problems, Maximize z=3x+7y subject to constraint x+4y x... Maximize z=3x+7y subject to constraint x+4y x,y>=0

Markert reseach, The Upjohn Company, based in Kalamazoo, Michigan, manufact... The Upjohn Company, based in Kalamazoo, Michigan, manufactures and markets pharmaceuticals and health-related products. With more than 19,000 employees and distribution in over 30

Duality, maximum 3x1+x2+x3-x4 subject to x1+5x2+3x3+4x4 x1+x2=-1 x3+x4 maximum 3x1+x2+x3-x4 subject to x1+5x2+3x3+4x4 x1+x2=-1 x3+x4

Solve by computational procedure of big – m method, Example 2 Max Z = 3... Example 2 Max Z = 3x 1 - x 2 Subject to             2x 1 + x 2 ≥ 2             x 1 + 3x 2 ≤ 3             x 2 ≤ 4     &     x 1 ≥ 0, x 2  ≥ 0   A