Linear Programming Problem, 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:- Linear Programming Problem

Simplex method, Maximize Z =3x+4x subject to x1+x2 =3 2x1+3x2 =4 x1,x2 =0

Maximize Z =3x+4x subject to x1+x2 =3 2x1+3x2 =4 x1,x2 =0

Simplex method, Solve the following Linear Programming Problem using Simple...

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

Operation research, 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

LPP, A paper mill prouduces two grads of paper viz., X and Y. Becouse of ra...

A paper mill prouduces two grads of paper viz., X and Y. Becouse of raw material restriction, it cannot product more then 400 tons of grade X paper and 300 tons of grade Y paper in

Information resources, INFORMATION RESOURCES: Information resources ar...

INFORMATION RESOURCES: Information resources are of two kinds, namely, Documentary and Non-Documentary Sources. Documentary Sources: A document embodies thought. I

Area under standard normal curve, Area under Standard Normal Curve The...

Area under Standard Normal Curve The graph  of the  standard  normal  curve y = p(z) with  different percentages areas is  shown here. Since p(z) is  a probability  distributi

Sequencing problem, how do you use gantt chart for solving sequencing probl...

how do you use gantt chart for solving sequencing problem ? why is it not employed for solving larger problems?

Linear programming, Solve the following Linear Programming Problem using Si...

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

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