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

Examine the future sustainability of business, In your role as a Consultant...

In your role as a Consultant to a renowned organisation or institution, you have been asked to design and submit a research proposal to examine the future sustainability of its bus

Linear programing, Maximize6x1+8x2+5x3,st,labour3x1+4x2+5x3 =0 then brefly ...

Maximize6x1+8x2+5x3,st,labour3x1+4x2+5x3 =0 then brefly explain x1,x2,x3;term labour,metal&plastic;the160hours;x1,x2&x3>=0

Principles of report writing, Principles of Report Writing Reports wri...

Principles of Report Writing Reports writing  may  involve the followings principles . a. Easy to Follow : The body of the  report should  be written in a self evident and

Game theory , 3 In a rectangular game, pay-off matrix of player A is as f...

3 In a rectangular game, pay-off matrix of player A is as follows:

Linear programming , #quesQuestion. a paper mill produces two grades of pa...

#quesQuestion. 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 of g

Semeter 5, explian completelly the operation reserch

explian completelly the operation reserch

LINEAR PROGRAMMING, b. A paper mill produces two grades of paper viz., X an...

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 pape

Lpp using sipmle method, Maximize Z= 3x1 + 2X2 Subject to the constraints: ...

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