linear programming, Operation Research

3. 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/26/2013 6:48:58 AM | Location : USA







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

Using   Software for Analysis Grouping and Displaying Data   to Convey Meaning Normal 0 false false false EN-IN X-NONE X-NONE

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

How do I set this problem up for Excel: A National Credit Union has $250,000 available to invest in a 12 month commitment. The money can be placed in Treasury notes yielding an 8%

Q3. 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

Preparation of visual Aids ,Handouts and Feedback Forms It is   always  better to prepare  visual  aids much  in advance of the presentation. Leaving  them for the  last mo

Operation research makes no allowance for intangible factors such as skill attitude vigor of the management people in taking decisions but in many instances success or fail

#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

Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2