lpp, 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:- lpp

Operation research, Discuss the methodology of operation research

Discuss the methodology of operation research

Chi square test as a test of homogeneit, Chi Square Test as a Test of Homog...

Chi Square Test as a Test of Homogeneit The X 2 test of homogeneity is an  extension of the chi square  test of independence of attributes. It is  designed to determine  whet

Uses of range - measure of dispersion, Uses of Range a.Range is suitab...

Uses of Range a.Range is suitable  measure  of dispersion  when the  data are too  scattered to justify the  computation of a more precise  measure of dispersion. b.In rece

Management Applications of Operation Research, Some areas of applications a...

Some areas of applications are Purchasing, Procurement and Exploration Quantities and timing of purchase Replacement policies Rules for buying, supplies Finance, Budgeting and Inv

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

what are the classifications of operations research?

Problems based on lpp when feasible region is unbounded, Problems based on ...

Problems based on LPP when feasible region is unbounded.     1.    Minimize z = 3x + 5y subject to constraints  X + y ≥ 2 X + 3y ≥ 3 X, y ≥ 0 script

Operating system, represent a diagrammatic way of components of the os

represent a diagrammatic way of components of the os

LPP., A constraints in an LPP restricts? (Value of objective function,Value...

A constraints in an LPP restricts? (Value of objective function,Value of decision variable,Use of available resources, uncertainty of optimum value) please help me to find out righ

Simplex method, Solve the following Linear Programming Problem using Simple...

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

Operation research, A PAPER MILL PRODUCES TWO GRADES OF PAPER VIZ., X AND Y...

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

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