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/14/2013 4:15:38 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

#question. 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 grad

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

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

BINOMIAL DISTRIUBITON This  distribution  (also known  as Bernoulli  distribution ) is useful  in such  an experiment where  there  are only two  outcomes success or failure g

Method of Calculation of Mean  Deviation a. Computation of Mean Deviation Individual Series : The process of computing mean  deviation in case  of individual series involves

During busy times, 60 potential customers per hour arrive at the booth (assume a Poisson distribution). A booth worker takes 5 minutes, on average, to meet the information needs of

These models are used to develop a method to evaluate the merit of alternative courses or action by representing with a mathematical model of the problems where various variab

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

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