Linear Programming , 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:- Linear Programming

Answering lp problems, ABC Company manufactures both interior and exterior ...

ABC Company manufactures both interior and exterior paints from 2 raw materials M1 and M2. The following table gives basic data of problem.     Exterior

Modi method, find optimal solution for a 3*4 matrix 42 27 24 35 46 37 32 3...

find optimal solution for a 3*4 matrix 42 27 24 35 46 37 32 32 40 40 30 35 using modi method

Explain what do you understand by dynamic programming, Question: (a) (i...

Question: (a) (i) Explain what do you understand by ‘Dynamic Programming'. (ii) Describe the dynamic programming approach to solve the shortest route problem. (iii) Outli

Game theory, #question:explain the theory of dominance in the solution of r...

#question:explain the theory of dominance in the solution of rectangular games?

Standara deviation - measure of dispersion , STANDARA DEVIATION Standa...

STANDARA DEVIATION Standard  deviation  is the  square  root of the  arithmetic  average of  squares of all  the deviations from the  mean. In short  it may  be defined  as th

ANSWER OF PROBLEM RELATING TO PERT AND CPM., ANSWER OF ACTIVITY WITH THEIR ...

ANSWER OF ACTIVITY WITH THEIR PRECEDING ACTIVITY AND DURATION OF TIME IN WEEKS?

Graphical solution procedure, Graphical Solution Procedure sample assignmen...

Graphical Solution Procedure sample assignment and solved questions, free examples and solved homework samples for Graphical Solution Procedure in operation research. Question

Solved the question, #questionthe following Linear Programming Problem usin...

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

Short question, write down any two assumption of L.P

write down any two assumption of L.P

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..

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