a paper mill, Operation Research

Assignment Help:
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 week. There are 160 production hours in week. It requires 0.20 & 0.40 hours to produce a ton of grade X & Y papers. The mill earns profits of Rs.200 & Rs.500 per ton of Grade X & Y paper respectively. Formulate this as a Linear Programming Problem.

Related Discussions:- a paper mill

Categories of information in social sciences, Categories of Information in ...

Categories of Information in Social Sciences: It would be useful, particularly in social sciences, to group information into three categories:  •  Statistical Information

OR, what is operation research an management decision making

what is operation research an management decision making

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

Automation, whatdo you mean by automation

whatdo you mean by automation

Linear Equation, Cohen Chemicals, produces two types of photo-developing fl...

Cohen Chemicals, produces two types of photo-developing fluids. The first, a black and white picture chemical, costs Cohen $2500 per ton to produce. The second, a colour photo chem

Using software for analysis grouping, Using   Software for Analysis Group...

Using   Software for Analysis Grouping and Displaying Data   to Convey Meaning Normal 0 false false false EN-IN X-NONE X-NONE

Assignment problem, 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 problem, Solve the following Linear Programming Problem ...

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

Game theory, if there were n workers and n jobs there would be

if there were n workers and n jobs there would be

LPP using Simple method, Maximize Z= 3x1 + 2X2 Subject to the constraints: ...

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