MB0048, 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:- MB0048

Regression, Regression line drawn as Y=C+1075x, when x was 2, and y was 239...

Regression line drawn as Y=C+1075x, when x was 2, and y was 239, given that y intercept was 11. calculate the residual

Level of significance - hypothesis testing , Level of Significance I...

Level of Significance In testing a given  hypothesis  the maximum  probability with which  we would  be willing  to take  risk is called  level of  significance of the  test.

LPP, A paper mill produces two grades of paper viz., X and Y. Because of ra...

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

Type of measures of dispersion - measure of dispersion, Type  of  Measur...

Type  of  Measures  of Dispersion   a. Absolute Measure: The measure of dispersion which  is expressed in  terms of the units of the  observations( e, g, Rupees , metre ,

Method of concurrent deviations, Method of Concurrent Deviations The  ...

Method of Concurrent Deviations The  coefficient  of concurrent  deviation or coefficient  of correlation  b the concurrent deviation  methods  is given  by the formula. R

#title, WHOM DO YOU THINK RAJENDER WILL EAT WITH? WHY?

WHOM DO YOU THINK RAJENDER WILL EAT WITH? WHY?

Ge, Ask question #Minimum 100 words what can engineer planner do in métallu...

Ask question #Minimum 100 words what can engineer planner do in métallurgie accepted#

Linear programming, solve the following linear programming problem using si...

solve the following linear programming problem using simplex method maximize z=3x1+2x2 subject to the constraints: x1+x2 x1+x2 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