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

Sampling decision, Normal 0 false false false EN-IN X...

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

Replacement models - operation research model, These models are used whe...

These models are used when one must decide the optimal time to replace equipment for one reason or the other for instance, in the case of equipment whose efficiency dete

Strategies and od intervention techniques, QUESTION 1 Change strategies...

QUESTION 1 Change strategies and OD intervention techniques follow from diagnosis. An inappropriate intervention due to a faulty diagnosis may be very costly to an organization

Knowledge - library and information services, Knowledge: The dictionar...

Knowledge: The dictionary definition of knowledge is 'organised body of information or the comprehension and understanding, consequent on having acquired an organised body of

Census method, Census Methods Complete Enumeration: If detail informat...

Census Methods Complete Enumeration: If detail information  regarding every individual  person  or item of a given   universe ( or  population ) is  collected then the  enquir

Solve the following lpp by graphical method, A company manufactures two typ...

A company manufactures two types of printed circuits. The requirements of transistors, resistors and capacitor for each type of printed circuits along with other data are given in

Paired sample sign test - hypothesis testing , Paired sample  sign Test ...

Paired sample  sign Test Paired samples  sign test is applied  to a situation where two sample  are taken from  two population which  have continuous symmetrical distributi

Lpp using sipmle method, Maximize Z= 3x1 + 2X2 Subject to the constraints: ...

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

Line balancing, what will happen when line balance doesn not exist

what will happen when line balance doesn not exist

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