Answer, Operation Research

Assignment Help:
A paper mill products two grade of paper viz., X & Y. Because of raw material restriction, it cannot produce more than 400 tons of grade X paper & 300 tons of grade Y paper in a week. There are 160 production hours in week. It requires 0.20 & 0.40 hours to produce a ton of grade X & Y papers. The mill earns profits of Rs.200 & Rs.500 per ton of Grade X & Y paper respectively. Formulate this as a Linear Programming Problem.

Related Discussions:- Answer

LINEAR PROGRAMMING, Meaning of Linear programming problem and explanation o...

Meaning of Linear programming problem and explanation of graphical method of solving Linear Programming Problem

Multi stage sampling - sampling decisions, Normal 0 false fal...

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

Comparing tablet personal computers with personal computer, Background: ...

Background: The use of "Tablet Personal Computers" such as HP's TouchPad and Apple's iPad has been increasing over the past several years. Task: Using a web browser and quality,

Identifying the solution to a problem, Software House named as Harvester, g...

Software House named as Harvester, got to increase the speed of service and I need to get 3000 words written

Characteristics, what are the characteristics of operation research

what are the characteristics of operation research

Operation Research Models, Explain the classification of models 1. Classifi...

Explain the classification of models 1. Classification by function or uses 2. Classification by degree of qualification 3. Classification by physical characteristics 4. Classidicat

LPP, #A paper mill produces two grades of paper viz., X and Y. Because of r...

#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

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

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