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

Linear programming , the application areas of linear programming

the application areas of linear programming

International trade, why does south africa regulate int''l trade

why does south africa regulate int''l trade

Phases of an or project, give me an example of pre-modelling, modelling and...

give me an example of pre-modelling, modelling and post modelling phases

How to solve operation research optimization questions, how to solve operat...

how to solve operation research optimization questions

Regression, Regression line drawn as Y=C+1075x, when x was 2, and y was 239...

Regression line drawn as Y=C+1075x, when x was 2, and y was 239, given that y intercept was 11. calculate the residual

Describe states-transitions and transition rate, Customers arrive to a supe...

Customers arrive to a super market according to a Poisson process with intensity V = ½  per minute. The supermarket has two counters, that use a common queue. Counter 1 is always o

Paired sample sign test - hypothesis testing , Paired sample  sign Test ...

Paired sample  sign Test Paired samples  sign test is applied  to a situation where two sample  are taken from  two population which  have continuous symmetrical distributi

Chi square test as a test of homogeneit, Chi Square Test as a Test of Homog...

Chi Square Test as a Test of Homogeneit The X 2 test of homogeneity is an  extension of the chi square  test of independence of attributes. It is  designed to determine  whet

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

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