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

Advantages of mean deviation - measure of dispersion, Advantages  of Mea...

Advantages  of Mean  Deviation a.It is based on all the  observation . any  change in any  item would  change the value of mean  deviation. b.Mean  deviation  is less  aff

Higher order table, Higher Order  Table   When  three  or more  charac...

Higher Order  Table   When  three  or more  characteristics are represented in the same  table such a table  is called  higher order table. The  need  for such  a table arises

Linear problem, #q A paper mill produces two grades of paper viz., X and Y....

#q 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 pape

Operation Research, A paper mill produces two grades of paper viz., X & Y. ...

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.

Or, meaning,significance of operations research in bussiness management?

meaning,significance of operations research in bussiness management?

Mccolvin''s principles, McColvin's Principles: L.R McColvin advanced h...

McColvin's Principles: L.R McColvin advanced his Demand and Supply Theory of Book Selection in 1925. He states, "Books in themselves are nothing. They have no more meaning tha

Solved the question, #questionthe following Linear Programming Problem usin...

#questionthe 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 programming simplex method, How to solve linear programming problems...

How to solve linear programming problems using simplex method introducing slack variable,surplus variable and artificial variable

Process design, what is process design? what are the factors that affects t...

what is process design? what are the factors that affects the process design?

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

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