fromulation of 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 ot grade Y paper in a week. there are 160 prodection hours in a week. it requires 0.20 and 0.04 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 linea programming problem.

Related Discussions:- fromulation of LPP

Unit 8, undertake the proposed research investigation in accordance with th...

undertake the proposed research investigation in accordance with the agreed specification and procedures

Steps of field study, Festinger and Katz have described followings six ste...

Festinger and Katz have described followings six steps in the conduct to a field study. a. Preliminary Planning :Deciding scope and objectives of study and the time table

Explain the method of taylor scientific management, a. Explain the method o...

a. Explain the method of "Taylor's Scientific Management". List the elements of Taylor's Scientific Management. b. List the necessary managerial functions of a Manager. Explain.

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 i

Mba, in a rectangular game ,pay of matrix of player A is as follows

in a rectangular game ,pay of matrix of player A is as follows

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

Research process, What kind of research situation do the two new brand...

What kind of research situation do the two new brands present for Mr. Lynn company?

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

#Solve the following Linear Programming Problem using Simplex 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