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

Sample size in non propbability- sampling decisions, Sample Size in Non Pro...

Sample Size in Non Propbability The probability  selection does not apply  to purposive  selection. The size  of the  non  probability samples  is selected  in a subjective ma

Lpp using sipmle method, Maximize Z= 3x1 + 2X2 Subject to the constraints: ...

Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

Usage in the context of library and information services, Usage in the Cont...

Usage in the Context of Library and Information Services: In library and information science, there is, however, no need for making such distinction between data and informati

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, 3. A paper mill produces two grades of paper viz., X an...

3. 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 pape

Model building is the essence of the operations research app, Model buildin...

Model building is the essence of the operations research approaches?

Determination of effectiveness measures, Determination of effectiveness Mea...

Determination of effectiveness Measures: Effectiveness measure is a measure of success of a model in representing a problem and providing a solution. It is the connecting link

Linear programming, maximize z=3x1+2x2 subgect to the constraints x1+x2 x1-...

maximize z=3x1+2x2 subgect to the constraints x1+x2 x1-x2 x1,x2>_0

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

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