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 1.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 grade Y respectively. Formulate this as a linear programming problem.

Related Discussions:- Linear Programming Problem

Experimental method, In this method variables beings studied are contro...

In this method variables beings studied are controlled by the investigator. In other the effect of one variable is observed while other relevant variables are held constant

Investigate the link between engine wear and mileage, The Association of Ma...

The Association of Malawi Mechanics has commissioned a study to investigate the link between engine wear and mileage. The main focus of the study is to determine whether the mileag

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

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

Knowledge - library and information services, Knowledge: The dictionar...

Knowledge: The dictionary definition of knowledge is 'organised body of information or the comprehension and understanding, consequent on having acquired an organised body of

Other determinants of sample size- sampling decisions, Other  Determinants ...

Other  Determinants  of Sample Size 1. The variability  of elements  within the population  has become  a  very  important  factor  to decide the  sample  size.    The more  v

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

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