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

Construction of a mathematical model, The 2 nd phase of operations Resear...

The 2 nd phase of operations Research is to construct a mathematical model representing the system under study. It requires the identification of both static and dynam

Identifying the solution to a problem, Software House named as Harvester, g...

Software House named as Harvester, got to increase the speed of service and I need to get 3000 words written

Sequential sampling -sampling decisons, Sequential Samplin The previou...

Sequential Samplin The previous  has shown  that the sampling  units  were drawn  prior  to the drawing of the actual   sample  and has  a fixed  size. But the  sequential  sa

Line balancing methods - heuristic approach, Line Balancing Methods - Heuri...

Line Balancing Methods - Heuristic Approach  Heuristic mean serving to find i.e. to find out discover things for oneself. Heuristic describes a particular approach to problem so

Jaguar, how jaguar implements aggregate planning?

how jaguar implements aggregate planning?

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

in a rectangular game ,pay of matrix of player A is as follows

PERT, how does it work

how does it work

LPP, A paper mill produces two grades of paper viz. X and Y. Because of raw...

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

Operation research, different classification of models in operation researc...

different classification of models in operation research

Simple method, Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 4 X...

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

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