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

Assumption for students test , Assumption for  students Test a.The p...

Assumption for  students Test a.The parent population from  which the samples is  drawn in normal. b.The sample observations  are random  i ,e the given  sample is  drawn

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

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

Validity of the model - operation research model, Deriving the Solution fro...

Deriving the Solution from the Model: This phase is devoted to the computation of those value of decision variables that maximize or minimize the objective function. Such

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

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,

Innovation.., identify a new technological innovation not yet commercialize...

identify a new technological innovation not yet commercialized (e.g., house cleaning robotic). What are the product''s features? In your paper, explain how that technological innov

LP - Assignment problem, I have looked at Hungarian algorithm to solve assi...

I have looked at Hungarian algorithm to solve assignment problem, but it seems like it is limited to 1-to-1 assignment. I would like to know how to do 1-to-3 assignment.

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

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

Model., is model the essence of oprational research.

is model the essence of oprational research.

Simplex method, Solve the following Linear Programming Problem using Simple...

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