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

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

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

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

A paper mill, A paper mill products two grade of paper viz., X & Y. Because...

A paper mill products two grade of paper viz., X & Y. Because of raw material restriction, it cannot produce more than 400 tons of grade X paper & 300 tons of grade Y paper in a we

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

Model building is the essence of the operations research approaches?

Correlation - correlation & regression analysis, Normal 0 false...

Normal 0 false false false EN-IN X-NONE X-NONE

Conclusions and recommendations , Conclusions and Recommendations  Con...

Conclusions and Recommendations  Conclusions  should  be drawn with  direct  reference to the objectives  of the study. The  readers should  be able  to read the objectives. T

Closed loop, Write a note on tracing a closed loop. What are the characteri...

Write a note on tracing a closed loop. What are the characteristic features of a closed loop?

Linear programming, maximize z=3x1+2*2 subject to the constraints x1+x2=4 x...

maximize z=3x1+2*2 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