mb0048, 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:- mb0048

Models, Which model is described as a rule of thumb

Which model is described as a rule of thumb

Calculation of ranks correlation , Calculation of Ranks Correlation W...

Calculation of Ranks Correlation Where Ranks  are Given: When the  actual  ranks  are given  the steps  followed are: a.Compute  the difference  of the  two ranks  (R1 and

Yates correction for continuity for 2x 2tables , Yates Correction for Cont...

Yates Correction for Continuity for  2x 2Tables If any cell frequency in  2x 2 table isles  than 5thenfor the application of X 2 test it  is pooled with the preceding or suc

Model building, model building is the essence of the operational research d...

model building is the essence of the operational research discuss

General rules, General Rules a. Attractive Shapes The tables  should ...

General Rules a. Attractive Shapes The tables  should be  neat  and  attractive. The size of  table  should be neither too big nor  small. b. Simplicity A table  should b

Vogel approximation methods, This method is more  systematic and orderly th...

This method is more  systematic and orderly than least cost method. Here penalties for each column and row of the transportation table are determined, and the row  or  column with

Operation research, Operations research is used by manager in making busine...

Operations research is used by manager in making business decisions. What are five each of its merit and demerit that the users need to be aware of?

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

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