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

Modi, there are 5 plants located in different cities and manufacturer a com...

there are 5 plants located in different cities and manufacturer a common produt A

Graphical solution procedure, Graphical Solution Procedure sample assignmen...

Graphical Solution Procedure sample assignment and solved questions, free examples and solved homework samples for Graphical Solution Procedure in operation research. Question

Assignment, A paper mill produces two grades of paper viz., X and Y. Becaus...

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

Preparation of visual aids , Preparation of visual Aids ,Handouts and Feedb...

Preparation of visual Aids ,Handouts and Feedback Forms It is   always  better to prepare  visual  aids much  in advance of the presentation. Leaving  them for the  last mo

Report writing - report writing presentation, REPORT WRITING The final...

REPORT WRITING The final step in research is to report the study  findings to those  who authorized the investigation. The American marketing association is  of the opinion  t

Classification of documents by information characteristics , Classification...

Classification of documents by information Characteristics: The schemes of classification advocated by Hanson and Grogan are mainly based on the information characteristics of

Linear programming problem, Solve the following Linear Programming Problem ...

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

Information resources, INFORMATION RESOURCES: Information resources ar...

INFORMATION RESOURCES: Information resources are of two kinds, namely, Documentary and Non-Documentary Sources. Documentary Sources: A document embodies thought. I

Simple method, solve the LPP using simple method, maximize z= 3x1+2x2 subje...

solve the LPP using simple method, maximize z= 3x1+2x2 subject to constraints

#transportation and linear models.., #what is the similarity and difference...

#what is the similarity and differences between transportation and linear programing models?

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