A paper mill produces two grades of paper viz., X and Y. Because of raw
each)
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 9:12:16 AM | Location : USA

Ask an Expert

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

Write your message here..

Related Questions

SIGNIFICANCE OF OPERATION RESEARCH, WHAT ARE THE SIGNIFICANCE OF OPERATION ... WHAT ARE THE SIGNIFICANCE OF OPERATION RESEARCH

Both LP and PIP, marginal rate of substitution, degeneracy and degenerate ... marginal rate of substitution, degeneracy and degenerate solution

Method of calculation of mode - measure of central tendency , Method of cal... 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

Linear programing, main components of a linear programming main components of a linear programming

Least cost method , definitions procedure and example definitions procedure and example

Operational research model, characteristics of operational research model characteristics of operational research model

Linear Programming, A paper mill produces two grades of paper viz., X and Y... 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

Solve the following Linear Programming Problem using Simple , Solve the fol... Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2

#title.L.L.p, #use the simple method to solve the following L.P.P. Maximi... #use the simple method to solve the following L.P.P. Maximize Z =4X1 +10X2 subject to constraints, 2X1 +X2 2X1+5X2 2X1 +3X2 X1,X2 > 0

Metholodolgy, metholodolgy of operational research metholodolgy of operational research