Linear Programming Problem, 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 6:23:32 AM | Location :







Related Discussions:- Linear Programming Problem, Assignment Help, Ask Question on Linear Programming Problem, Get Answer, Expert's Help, Linear Programming Problem Discussions

Write discussion on Linear Programming Problem
Your posts are moderated
Related Questions
The sequencing problems arises whenever there is problems in determining the sequence ( order) in which a member of tasks can be performed by a number of service facilities su

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

Ranganathan's Principles: Perhaps it would be worthwhile to consider the Five Laws of Library Science of Dr. S. R. Ranganathan as the basic guidelines for formulating the obje


explain the different techniques as operation research


Word problems based on formulation of linear programming problems. 2.   A manufacturer produces nuts and bolts for industrial machinery. It takes 1 hour of work on machine 1 an

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

Hypothesis  Building and Testing The foundation of hypothesis building  lies in discovering links between  elements  of your data. CAQDAS can help you to  discover these links

Question: (a) Discuss briefly the four basic components of any queueing system. (b) Explain what you understand by the following models: (i) (M| M | 1 : N | FCFS) (ii