Linear Programing, 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 Programing

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 in

Semeter 5, explian completelly the operation reserch

explian completelly the operation reserch

Simplex method LPP, #questioA paper mill produces two grades of paper viz.,...

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

MODERN MANAGEMENT, DISCUSS THE SIGNIFICANCE AND SCOPE OF OPERATION RESEARCH...

DISCUSS THE SIGNIFICANCE AND SCOPE OF OPERATION RESEARCH IN MODERN MANAGEMENT

Modi, history of modi

history of modi

Case Analysis, Ask question #Minimum 100 woRead this article and then write...

Ask question #Minimum 100 woRead this article and then write a three-page summary of the application (problem definition, objective function constraints, decision variables, etc.)

Scope, Scope of operations research

Scope of operations research

Linear programming , A paper mill produces two grades of paper viz., X and ...

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

Linear programming., Q3. Solve the following Linear Programming Problem usi...

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

Vogel approximation methods, This method is more  systematic and orderly th...

This method is more  systematic and orderly than least cost method. Here penalties for each column and row of the transportation table are determined, and the row  or  column with

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