Operation research, 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:- Operation research

Op, A paper mill produces two grades of paper viz., X and Y. Because of raw...

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

Experimental method, In this method variables beings studied are contro...

In this method variables beings studied are controlled by the investigator. In other the effect of one variable is observed while other relevant variables are held constant

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

Uses of standard deviation - measure of dispersion, Uses   of Standard D...

Uses   of Standard Deviation Normal 0 false false false EN-IN X-NONE X-NONE

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

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

Linear progaming, #questA paper mill produces two grades of paper viz., X a...

#questA 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 p

Game theory , 3 In a rectangular game, pay-off matrix of player A is as f...

3 In a rectangular game, pay-off matrix of player A is as follows:

T, #Principles of OR

#Principles of OR

Linear programming problem, #Solve the following Linear Programming Problem...

#Solve the following Linear Programming Problem using Simplex 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