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

Ques, Ask questb. A Company produces 150 cars. But the production rate vari...

Ask questb. A Company produces 150 cars. But the production rate varies with the distribution. Production Rate 147 148 149 150 151 152 153 Probability 0.05 0.10 0.15 0.20 0.30 0.15

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 X1 - X2 = 2 X1, X2 = 0

Machine tabulation, Machine  Tabulation This methods  of tabulating i...

Machine  Tabulation This methods  of tabulating information  is generally used in  case of extensive  large scale  surveys. Mechanical sorting and tabulating equipments and su

Dina, Construct a two-variable LP model that: · Maximizes Z; · ...

Construct a two-variable LP model that: · Maximizes Z; · All coefficients in the objective function are greater than 500; · Includes at least 5 constraints;

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

Optimization , A company uses 4 pounds of resource 1 to make each unit of X...

A company uses 4 pounds of resource 1 to make each unit of X1 and 3 pounds of resource 1 to make each unit of X2. There are only 150 pounds of resource 1 available. Which of the fo

#methode, #what are the methods of OR ?

#what are the methods of OR ?

Linear programming, solve the following linear programming problem using si...

solve the following linear programming problem using simplex method maximize z=3x1+2x2 subject to the constraints: x1+x2 x1+x2 x1,x2>=0

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

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