LPP, Operation Research

Assignment Help:
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.

Related Discussions:- LPP

Linear programming, How do I set this problem up for Excel: A National Cred...

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%

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

Determine capacity of unit, Show simple vapour compression Refrigeration cy...

Show simple vapour compression Refrigeration cycle with showing all the devices and also draw T-sand P-R diagram and illustrate it also. A Bell-Coleman cycle works between 1 bar

Research, Discus and explain both probability and none probability sampling...

Discus and explain both probability and none probability sampling techniques

LLP, A paper mill produces two grades of paper viz., X and Y. Because of ra...

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

Line balancing methods - heuristic approach, Line Balancing Methods - Heuri...

Line Balancing Methods - Heuristic Approach  Heuristic mean serving to find i.e. to find out discover things for oneself. Heuristic describes a particular approach to problem so

Linear programming, solve the following linear programming problem using si...

solve the following linear programming problem using simplex method maximize z=3x1+2x2 subject to the constraints: x1+x2 x1+x2 x1,x2>=0

Replacement theory.., a pipe lis dur for rpair,the repair would cost 10000 ...

a pipe lis dur for rpair,the repair would cost 10000 and it would last for 3 years.alternatively a new pipe line can be purchase at 30000 for 10 years.assuming 10% depriciation rat

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd