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

Solve lpp by using its duality, Maximize w = 5x -2y +3z subject to 2x +2y -...

Maximize w = 5x -2y +3z subject to 2x +2y -z>=2 y + 3z

Variables, Variables A concept which varies is variable. These can be ...

Variables A concept which varies is variable. These can be different in quantitative values. For example, weight, height, income are examples of variables. Qualitative phenom

LPP FORMULATION., 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

Game theory, #question:explain the theory of dominance in the solution of r...

#question:explain the theory of dominance in the solution of rectangular games?

Operation research, Discuss the methodology of operation research

Discuss the methodology of operation research

Deviation taken from assumed mean, Deviation Taken from Assumed Mean ...

Deviation Taken from Assumed Mean This methods  is assorted  when the  arithmetic  average  is a  fractional value. Taking  deviation from  fractional value would  be a ver

Simplex solution, difference between simplex solution procedure for maximis...

difference between simplex solution procedure for maximisation and minimisation

#methode, #what are the methods of OR ?

#what are the methods of OR ?

Linear programming problem, Solve the following Linear Programming Problem ...

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