LPP Sum, 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:- LPP Sum

Action Phase, What is The proper meaning of action phase will u help me to ...

What is The proper meaning of action phase will u help me to lern it in deeply????

Linear problem, A paper mill produces two grades of paper viz., X and Y. Be...

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 i

Individual user interests - information resources, Individual User Interest...

Individual User Interests: More specific information about users could cover the following:  Subjects and associated interest - e.g. specific subjects, allied subjects;

Assignment, Q2. Six Operators are to be assigned to five jobs with the cost...

Q2. Six Operators are to be assigned to five jobs with the cost of assignment in Rs. given in the matrix below. Determine the optimal assignment. Which operator will have no assign

Classification of documents - books, Books: Books form  one of the pri...

Books: Books form  one of the primary sources of information. They provide a cohesively organised (thought content) information on a specific subject of optimum depth. Since b

Two handed process chart of signing a latter, Two Handed process Chart of S...

Two Handed process Chart of Signing a Latter     A multiple  activity  chart  records the related  sequence of activities  of more  than one subject, men  and / or  machine  o

one tailed test diagrams - hypothesis testing, Normal 0 false ...

Normal 0 false false false EN-IN X-NONE X-NONE

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

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