linear programming problem, 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 problem

Simplex method LPP, #questioA paper mill produces two grades of paper viz.,...

#questioA 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

Scattered responsibility and authority, Scattered Responsibility and Autho...

Scattered Responsibility and Authority: In a big industry responsibility and authority of decisions making is scattered throughout the organization and thus the organization.

Periodicals and serials - classification of documents, Periodicals and Seri...

Periodicals and Serials: Periodical publications form an important part of today's information world. It is one of the oft chosen forms of research communication. There are ov

Linear programming , #quesQuestion. a paper mill produces two grades of pa...

#quesQuestion. a paper mill produces two grades of paper viz.,xand y.Bacause of raw material restrictions, it cannot produce more than 400 tones of grade x paper and 300 tons of g

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

Uses of mean deviation - measure of dispersion, Uses  of Mean  Deviation...

Uses  of Mean  Deviation Mean  Deviation  is rarely being used as a measure of dispersion. But  due to  easy  and  simplicity  in calculation. It  is rather  useful  in busin

Solve by simplex method, Solve by simplex method Maximize Z = 5...

Solve by simplex method Maximize Z = 5x 1 + 3x 2 Subject to 3x 1 + 5x 2 ≤ 15 5x 1 + 2x 2 ≤ 10 &         x 1 ≥ 0, x 2  ≥ 0 [Ans. Max Z = 235/19

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