Linear programming, Operation Research

Assignment Help:
b. 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

Linear programming , #questionQuestion. a paper mill produces two grades o...

#questionQuestion. a paper mill produces two grades of paper viz.,xand y.Bacause of raw material restrictions, it cannot produce more than 400 tones of grade x paper and 300 tons

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

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

Semeter 5, explian completelly the operation reserch

explian completelly the operation reserch

Explain the history of boots and shoes, Question 1 Explain any five access...

Question 1 Explain any five accessory industries Question 2 Explain the history of boots and shoes Question 3 Write short notes on following- Types of Gujarati emb

Do it - report writing presentation , Do it  Everything  about  the...

Do it  Everything  about  the presentation is  ready and so  are you. The only  things  left if to face the audience in a confident and positive  manner and leave a mark on

Theoretical framework, Ask questiAvatars are virtual characters that can be...

Ask questiAvatars are virtual characters that can be used as representatives of a company that is using the Internet as a distribution channel. For instance, avatars can be used as

One sample sign test - hypothesis testing , One Sample sign Test In...

One Sample sign Test In a one  sample  test the  null  hypothesis μ = μ 0 against an  appropriate alternative on the basis of a random sample of size n we replace each sam

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

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