Linear Programming , 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:- Linear Programming

Optimum assignment, Six Operators are to be assigned to five jobs with the ...

Six Operators are to be assigned to five jobs with the cost of assignment in Rs. given in the matrix below. Determine the optimal assignment. Which operator will have no assignment

Linear programming, #questiona paper mill produce two grades of x&y.becouse...

#questiona paper mill produce two grades of x&y.becouse of raw material reswtriction

Application of the chi square test - hypothesis testing, Application of the...

Application of the chi Square Test   The  chi square distribution  has a number of applications are given  below: a.Chi Square test of goodness of fit. b.Chi square te

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

Operation Research, 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 the following Linear Programming Problem using Simple , Solve the fol...

Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2

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

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