linear programming, 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

Meaning and definition, Meaning and Definition If a group  of N observ...

Meaning and Definition If a group  of N observations is  arranged in ascending or descending  order of magnitude then the  middle  value is  called  median of  these  observat

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

Determination of effectiveness measures, Determination of effectiveness Mea...

Determination of effectiveness Measures: Effectiveness measure is a measure of success of a model in representing a problem and providing a solution. It is the connecting link

Disadvantages of mean deviation - measure of dispersion, Disadvantages of ...

Disadvantages of Mean Deviation a.Mean deviation ignores  the algebraic  signs of the deviations and  such it is  not capable  of further algebraic  treatment. b.It is  no

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

Method of calculation of mean deviation, Method of Calculation of Mean  De...

Method of Calculation of Mean  Deviation a. Computation of Mean Deviation Individual Series : The process of computing mean  deviation in case  of individual series involves

Problems based on lpp when feasible region is a line segment, Problems base...

Problems based on LPP when feasible region is a line segment or it does not exist. 1.    Maximize z = 2x+3y subject to the constraints X + y ≤ 1 X + y ≥ 3 X,  y ≥ 0

LINEAR PROGRAMMING, A DRUG MANUFACTURER produces 2 products X1 and X2.X1 ne...

A DRUG MANUFACTURER produces 2 products X1 and X2.X1 needs 2 hours on machine A AND 2 HOURS ON MACHINE B.X2 needs 3 hours on machine A and 1 hour on machine B.If machine A can run

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