Linear Programming, 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/13/2013 9:17:47 PM | 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
Maximize w = 5x -2y +3z subject to 2x +2y -z>=2 y + 3z

SOLVE THE FOLLOWING LP USING SIMPLE METHOD MAXIMIZE Z=3X1+2X2 SUBJECT TO CONSTRAINT X1+X2 X1-X2 X1,X2>=0

The systematic methodology developed for an operation research study with problems involving conflicting multiple objective policies and alternatives. Operation research in

Cases are generally based on certain issues and problems. Diagnostic, analytical and decision making skills help in case solution. A case study or case based assessment is designed

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

Background: The use of "Tablet Personal Computers" such as HP's TouchPad and Apple's iPad has been increasing over the past several years. Task: Using a web browser and quality,

.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

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

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

maximize z=3x1+2*2 subject to the constraints x1+x2=4 x1-x2=2 x1.x2=0