Calculate, 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 rs200 and rs 500 per ton of grade X and Y paper respectively. FORMULATE THIS IS A LINEAR PROGRAMMING PROBLEM

Related Discussions:- Calculate

Post-optimal analysis, It can be seen from the optimal solution for the fou...

It can be seen from the optimal solution for the foundry problem that two resources, raw material-1 and labor, are exhausted whereas the other two resources, raw materi

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

Scope, Scope of operation research?

Scope of operation research?

Operation research techniques, Select five Operations Research techniques a...

Select five Operations Research techniques and describe in detail the real world application of such techniques in business decision making.

Decision analysis models, These models deal with the selection of an opt...

These models deal with the selection of an optimal course of action given the possible pay offs and their associated probability of occurrence. These models are broadly

Banking operations, sir plz suggest me any book for this...or notes.....

sir plz suggest me any book for this...or notes.....

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

Maths, Maxz=3x1-2x2 St x1-x2 >_0, 3x1-x2 _0

Maxz=3x1-2x2 St x1-x2 >_0, 3x1-x2 _0

Linear programming problem, #Solve the following Linear Programming Problem...

#Solve the following Linear Programming Problem using Simplex method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

Punam Gupta

1/28/2013 2:22:55 AM

Pls solve this immediately.

Gunjan

1/28/2013 10:32:09 AM

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 rs200 and rs 500 per ton of grade X and Y paper respectively. FORMULATE THIS IS A LINEAR PROGRAMMING PROBLEM

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