Assignment SMU, Operation Research

Assignment Help:
A paper mill produces two grades of paper viz., X & Y. Because of raw material restrictions, it cannot produce more 400 tons of grade X paper & 300 tons of grade Y paper in a week. There are 160 production hours in a week. It requires 0.20 & 0.40 hours to produce a ton of grade X & Y papers. The mill earns a profit of Rs.200 & Rs.500 per ton of grade X & Y paper respectively. Formulate this as a Linear Programming Problem.

Related Discussions:- Assignment SMU

Linear pograming, application area of linear programing problem

application area of linear programing problem

Data and information, Data and Information: The term "data" (plural fo...

Data and Information: The term "data" (plural form of datum) refers to "an individual fact, statistic, or a piece of information or a group or a body of facts, statistics or t

Transportation, we have three reservoirs with daily supplies of15, 20 and 2...

we have three reservoirs with daily supplies of15, 20 and 25 litres of fresh water respectively. on each day we must supply four cities A B C D whose demands are 8 10 12 and 15 res

Linear programming problem, A paper mill produces two grades of paper viz.,...

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

Replacement models - operation research model, These models are used whe...

These models are used when one must decide the optimal time to replace equipment for one reason or the other for instance, in the case of equipment whose efficiency dete

Job sequencing problem, on which basis we take value in time out time in co...

on which basis we take value in time out time in column?

Scientific research, Scientific research is building of knowledge throug...

Scientific research is building of knowledge through collection of empirically verifiable facts. The term verifiable here means which can be checked by others for accuracy

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

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

Model, Importance of models

Importance of models

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