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

Rank sum test the mann whitney u - test, RANK SUM TEST THE  MANN WHITNEY U...

RANK SUM TEST THE  MANN WHITNEY U - TEST Mann  Whitney u test is an alternative to the  samples  test. This  test is based  on the ranks  of the  observation of two samples pu

Components included in the reseach proposal, Components Included in the Pro...

Components Included in the Proposal Personnel In case the proposal is addressed to the funding agencies, the qualifications of the key project personnel for study should be

Linear proramming , 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

Calculate, A paper mill produces two grades of paper viz X and Y. Because o...

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

Information concept and characteristics, INFORMATION AND OTHER RELATED CONC...

INFORMATION AND OTHER RELATED CONCEPTS - THEIR MEANING AND CHARACTERISTICS: You may often hear or read in newspapers and other popular magazines about "exponential growth of i

Chi square test for independence of attribute , Chi Square Test for Indepe...

Chi Square Test for Independence  of Attribute The chi square  test  can be  used to find out  whether two  or more attributes are associated or not. This  test helps  in fin

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

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