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

Linear programming, maximize z=3x1+2x2 subgect to the constraints x1+x2 x1-...

maximize z=3x1+2x2 subgect to the constraints x1+x2 x1-x2 x1,x2>_0

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

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 i

General rules, General Rules a. Attractive Shapes The tables  should ...

General Rules a. Attractive Shapes The tables  should be  neat  and  attractive. The size of  table  should be neither too big nor  small. b. Simplicity A table  should b

Lp, #question.Solve the following Linear Programming Problem using Simple m...

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

Action phase - phase of operation research, The action phase consists of ...

The action phase consists of making recommendations for remedial action to those who first posed the problem and who control the operations directly. These recommendatio

Steps involved in linear programming problem formulation, Question A - Line...

Question A - Linear Programming is most widely used technique for large number of applications in business industry as well as in various other fields. Describe in brief the steps

Linear programimg, Solve the following Linear Programming Problem using Si...

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

Inherent forces fomenting conflicts of interest, Inherent forces fomenting ...

Inherent forces fomenting conflicts of interest Several forces have coalesced to increase the incidence of conflicts of interest in the medical industry: the vertical integrat

Classification of models, what are the classifications of operations resea...

what are the classifications of operations research?

Linear programing, A factory employs unskilled workers earning $135 per wee...

A factory employs unskilled workers earning $135 per week and skilled workers earning $270 per week. It is required to keep the weekly age bill below $24,300. The machine requires

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