LPP, Operation Research

Assignment Help:
A paper mill prouduces two grads of paper viz., X and Y. Becouse of raw material restriction, it cannot product more then 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 200 and 500 per ton of grade Xand Y paper respectively. Formulate this as a Linear programming problem

Related Discussions:- LPP

Operation research, Discuss the methodology of operation research

Discuss the methodology of operation research

Determine capacity of unit, Show simple vapour compression Refrigeration cy...

Show simple vapour compression Refrigeration cycle with showing all the devices and also draw T-sand P-R diagram and illustrate it also. A Bell-Coleman cycle works between 1 bar

Multiple objectives- sampling decisions, Multiple  Objective s The sam...

Multiple  Objective s The sample  may vary according  to the  objective of the research. There  may several objectives  of marketing  research so the  sample  size  may vary a

Solve by computational procedure of big – m method, Example 2 Max Z = 3...

Example 2 Max Z = 3x 1 - x 2 Subject to             2x 1 + x 2 ≥ 2             x 1 + 3x 2 ≤ 3             x 2 ≤ 4     &     x 1 ≥ 0, x 2  ≥ 0   A

Determination of objectives and values, In the judgement phase due care ...

In the judgement phase due care must be given to define correctly the frame of references of the operation. Objectives and values, whether economic social or aesthetic shoul

Modi Method, a manufacture wants to ship 8 loads of his product as shown be...

a manufacture wants to ship 8 loads of his product as shown below. The matrix gives the mileage from origin to the destination D.

Dynamic programming models, Dynamic programming may be considered thoutgr...

Dynamic programming may be considered thoutgrowth of mathematical programming and involves the optimization of multistage( sequence of inter related decisions) decision process

Linear programming, maximize z=3x1+2*2 subject to the constraints x1+x2=4 x...

maximize z=3x1+2*2 subject to the constraints x1+x2=4 x1-x2=2 x1.x2=0

Linear programming problem, A paper mill produces two grades of paper viz....

A paper mill produces two grades of paper viz., X and Y. Because of raw each) material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of g

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