wanna solution for this, 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/11/2013 4:46:56 AM | Location : USA







Related Discussions:- wanna solution for this, Assignment Help, Ask Question on wanna solution for this, Get Answer, Expert's Help, wanna solution for this Discussions

Write discussion on wanna solution for this
Your posts are moderated
Related Questions
Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2

#questiSix 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 ass

CONSIDER A BARBER SHOP WITH ONE CHAIR, ONE BARBER AND NO ROOM FOR CUSTOMER TO WAIT. IF THE CHAIR IS EMPTY WHEN THE CUSTOMER ARRIVES,HE ENTER THE SHOP AND HIS HAIR CUT BEGINS. IF TH

regression line drawn as y=c + 1075x, when x was 2, and y was 239, given that y intercept was 11. calculate the residual

Write a research paper in relation to a Software Design related topic. Diagrams and drawing of attention to key points through highlighting, bulleting etc is encouraged. Questi

factors affecting tha transportation cost

Case Study - Experimental Design Dental Clinic A leading dental clinic  with  three well qualified  dentists is seriously  considering  keeping  in touch  with  its  pat

#quesSix 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 assig

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

write down any two assumption of L.P