Linear programming, 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/12/2013 4:59:29 AM | Location :







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
Related Questions

six operators are to be assigned to the 5 jobs with the cost of assignments

Method of calculation of Mode Calculation  of Mode  Individual  series: For determining  mode count the  number of times the  various  values  repeat  themselves and the  va

1) Provide an overall description of the business and the competitive environment in which it operates.  You should describe: a) what type of business it  is (e.g. retail, manuf

Question: (a) (i) Explain what do you understand by ‘Dynamic Programming'. (ii) Describe the dynamic programming approach to solve the shortest route problem. (iii) Outli

a manufacture wants to ship 8 loads of his product as shown below. The matrix gives the mileage from origin to the destination D. Origin Destination Available A B C X 50 30 220

Simple Graph The values of the two variables are plotted on a graph paper. We get two curves one for x variables and another for y  variables. These  two curves reveal the dir

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 we

Q2.Six Operators are to be assigned to five jobs with the cost of assignment in Rs. given in the matrix below. Determine the optimal assignment. Which operator will have no assignm