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

One tailed and two tailed tests -hypothesis testing , Normal 0 ...

Normal 0 false false false EN-IN X-NONE X-NONE

MB0048, A PAPER MILL PRODUCES TWO GRADES OF PAPER VIZ., X AND Y. BECAUSE OF...

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 mode - measure of central tendency , Method of cal...

Method of calculation of Mode Calculation  of Mode  Individual  series: For determining  mode count the  number of times the  various  values  repeat  themselves and the  va

Question, i need many good and important question of operation research obo...

i need many good and important question of operation research obout dinamic programing and non-liner programing and integer orograming ....for study! thank you

Study the case and provide an alternative compensati, #queStudy the case an...

#queStudy the case and provide an alternative compensation design, which would redress the problem faced by the two- wheeler major in Chennai.stion..

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

Semeter 5, explian completelly the operation reserch

explian completelly the operation reserch

LLP Simple method, Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2...

Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0 on..

TRANSPOTATION, LIMITS OF TRANSPOTATION PROBLEM

LIMITS OF TRANSPOTATION PROBLEM

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