A paper mill products two grade of paper viz., X & Y. Because of raw material restriction, it cannot produce more than 400 tons of grade X paper & 300 tons of grade Y paper in a week. There are 160 production hours in week. It requires 0.20 & 0.40 hours to produce a ton of grade X & Y papers. The mill earns profits of Rs.200 & Rs.500 per ton of Grade X & Y paper respectively. Formulate this as a Linear Programming Problem.

Posted Date: 2/14/2013 5:35:57 AM | Location : USA

Ask an Expert

Related Discussions:- a paper mill, Assignment Help, Ask Question on a paper mill, Get Answer, Expert's Help, a paper mill Discussions

Write discussion on a paper mill
Your posts are moderated

Write your message here..

Related Questions

#transportation and linear models.., #what is the similarity and difference... #what is the similarity and differences between transportation and linear programing models?

Inventory Control Model, 1. A local university purchases exercise books to ... 1. A local university purchases exercise books to give to their students. Instead of a fixed unit cost, their supplier quotes the following discount pricing: Order quantity Unit P

BIG M, minimization minimization

Least cost method of transportation model, how do you calculate using this ... how do you calculate using this method where the least cost appears twice

1, A paper mill produces two grades of paper viz., X and Y. Because of raw ... 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

Linear programming problem, Solve the following Linear Programming Problem ... 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

Linear programming , A paper mill prouduces two grads of paper viz., X and ... A paper mill prouduces two grads of paper viz., X and Y. Becouse of raw material restriction, it cannot product more then 400 tons of grade X paper and 300 tons of grade Y paper in

Simplex method, Solve the following Linear Programming Problem using Simple... 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

Transportation and linear programming., #what is the similarity and differe... #what is the similarity and difference between transportation and linear programing models?

Application Areas of Linear Programming, what is meant by Application Areas... what is meant by Application Areas of Linear Programming?