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

Dynamic programming, A company is planning its advertising strategy for the...

A company is planning its advertising strategy for the next year for its three major products.

Simplex, Maximize Z = 2x - 7y subject -2x + 3y = 3 4x + 5y >= 10 6x + 7y 4...

Maximize Z = 2x - 7y subject -2x + 3y = 3 4x + 5y >= 10 6x + 7y 4x + 8y >= 5

Help me please , This year Jan Rich, who is ranked number one in women''s s...

This year Jan Rich, who is ranked number one in women''s singles in tennis, and Marie Wacker, who is ranked number three, will play 4 times. If Marie can beat Jan 3 times, she will

Understandibg concepts, what are the preconceptions do you bring to the stu...

what are the preconceptions do you bring to the study of research

Graphical method- minimization example, Minimization Example  A ...

Minimization Example  A farmer is advised to utilize at least 900 kg of mineral A and 1200 kg of mineral B to increase the productivity of crops in his fields.

Decision theory, the following table gives place under different states of ...

the following table gives place under different states of nature Strategies States of nature s1 s2 s3 A 10000 3000 2000 B

T, #Principles of OR

#Principles of OR

Microforms and photographs - classification of documents, Photographs and I...

Photographs and Illustrations: Photographs and illustrations are documents which provide a visual or pictorial representation of a person, place or situation which words fail

Linear programming, solve the following linear programming problem using si...

solve the following linear programming problem using simplex method maximize z=3x1+2x2 subject to the constraints: x1+x2 x1+x2 x1,x2>=0

Linear programimg, Solve the following Linear Programming Problem using Si...

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