Linear Programming, Operation Research

Assignment Help:
b. 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:- Linear Programming

Construction of a mathematical model, The 2 nd phase of operations Resear...

The 2 nd phase of operations Research is to construct a mathematical model representing the system under study. It requires the identification of both static and dynam

Data management, Data Management As your  research project progresses ...

Data Management As your  research project progresses you will  quickly  gather more  and more  data. These need  to be managed in such  a way that they  can be  accesses and

Techniques, explain the different techniques as operation research

explain the different techniques as operation research

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

#transportation and linear models.., #what is the similarity and difference...

#what is the similarity and differences between transportation and linear programing models?

Or, meaning,significance of operations research in bussiness management?

meaning,significance of operations research in bussiness management?

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

Linear programming, Solve the following Linear Programming Problem using Si...

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

Chi square test for independence of attribute , Chi Square Test for Indepe...

Chi Square Test for Independence  of Attribute The chi square  test  can be  used to find out  whether two  or more attributes are associated or not. This  test helps  in fin

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