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

test statistic - hypothesis testing , Test Statistic The next  step ...

Test Statistic The next  step is compute an appropriate  test statistic which  is based on an appropriate probability distribution. It  is used to test whether the null  hypo

A paper mill produces two grades of paper viz., A paper mill produces two g...

A paper mill produces two grades of paper viz., X & Y. Because of raw material restrictions, it cannot produce more 400 tons of grade X paper & 300 tons of grade Y paper in a week.

Mk, Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = ...

Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

Sequencing models, The sequencing problems arises whenever there is probl...

The sequencing problems arises whenever there is problems in determining the sequence ( order) in which a member of tasks can be performed by a number of service facilities su

Describe the monte carlo simulation, Question A The basic characteristic f...

Question A The basic characteristic feature of Operations Research is that it employs mathematical representations or models to analyse problems. Explain the methodology of Operat

Linear programming, maximize z=3x1+2x2 subgect to the constraints x1+x2 x1-...

maximize z=3x1+2x2 subgect to the constraints x1+x2 x1-x2 x1,x2>_0

TRANSPOTATION, LIMITS OF TRANSPOTATION PROBLEM

LIMITS OF TRANSPOTATION PROBLEM

Linear programming., Q3. Solve the following Linear Programming Problem usi...

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

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