linear programning, Operation Research

b. 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/21/2013 12:39:28 AM | Location : USA







Related Discussions:- linear programning, Assignment Help, Ask Question on linear programning, Get Answer, Expert's Help, linear programning Discussions

Write discussion on linear programning
Your posts are moderated
Related Questions
Video  Tapes  Video  tapes  are very  information  and attention  grabbing  presentational  supports. They  are  best  for illustrating the  persons  in actions  and presen

Reports: Report literature is an important primary source of information, particularly  for a research library. This new  medium for communication of information came into bei

How to solve linear programming problems using simplex method introducing slack variable,surplus variable and artificial variable


- 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 pape


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

b. 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 pape

Assumption of F- Test The  theoretical assumption on which  F test  is based are: 1.The populations for  each sample must  be normally  distributed  with  identical  mean

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 assignment