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

Posted Date: 2/22/2013 2:24:02 AM | Location : USA

Ask an Expert

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

Write your message here..

Related Questions

Operation research, Significance of operation research Significance of operation research

Scope of operations research, Scope of the OR techniques can be derived ... Scope of the OR techniques can be derived in followings various importance fields: 1. In Agriculture : With the explosion of population and consequent shortage of food O

Scope, Scope of operation research? Scope of operation research?

Narrowing the research problem, NARROWING THE RESEARCH PROBLEM You h... NARROWING THE RESEARCH PROBLEM You have read how from a general topic we have arrived at the definition of the problem to be studied. Now we have to narrow it down furthe

Information concept and characteristics, INFORMATION AND OTHER RELATED CONC... INFORMATION AND OTHER RELATED CONCEPTS - THEIR MEANING AND CHARACTERISTICS: You may often hear or read in newspapers and other popular magazines about "exponential growth of i

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

Queuing model, problems problems

Identifying the solution to a problem, Software House named as Harvester, g... Software House named as Harvester, got to increase the speed of service and I need to get 3000 words written

Lntroduction, scope of operation research\ scope of operation research\