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

Carry out resource levelling for equipment resource, Teesside Construction ...

Teesside Construction is developing a schedule for a major building project to start in 04/01/2011 in Middlesbrough, UK. The project manager has identified major activities of the

Operation, #question.A paper mill produces two grades of paper viz., X and ...

#question.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 grad

Mba , in a rectangular game pay off matrix of player a is as follows ...

in a rectangular game pay off matrix of player a is as follows B1 B2 A1 5 7 A2 4 0 salve the game write down the pay off matrix of B and then solve the ga

Cpm/pert, how to make an attractive assignment

how to make an attractive assignment

Operation Research, Significance & scope of operation research in modern ma...

Significance & scope of operation research in modern management

OR, Models in OR

Models in OR

Microforms and photographs - classification of documents, Photographs and I...

Photographs and Illustrations: Photographs and illustrations are documents which provide a visual or pictorial representation of a person, place or situation which words fail

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

Simplex, Maximize Z = 2x - 7y subject -2x + 3y = 3 4x + 5y >= 10 6x + 7y 4...

Maximize Z = 2x - 7y subject -2x + 3y = 3 4x + 5y >= 10 6x + 7y 4x + 8y >= 5

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