QNT, 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:- QNT

Testing operation research model, After testing the model and its solutio...

After testing the model and its solution the next step of the study is to establish control over the solution by proper feedback of the information on variables which deviated

LPP, #A paper mill produces two grades of paper viz., X and Y. Because of r...

#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

Simplex solution, difference between simplex solution procedure for maximis...

difference between simplex solution procedure for maximisation and minimisation

Replacement theory.., a pipe lis dur for rpair,the repair would cost 10000 ...

a pipe lis dur for rpair,the repair would cost 10000 and it would last for 3 years.alternatively a new pipe line can be purchase at 30000 for 10 years.assuming 10% depriciation rat

Uses of mode - measure of central tendency, Uses of Mode The  use of t...

Uses of Mode The  use of the mode is recommended in the following  situations: a.When a quick  and approximate measures of  central tendency desired. b.When the  measure

Biographies, Biographies, Handbooks and Dictionaries: Dictionaries: ...

Biographies, Handbooks and Dictionaries: Dictionaries: Dictionaries  primarily deal with all aspects of  words from  proper definitions to spellings. Webster's Third Ne

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

write down any two assumption of L.P

Linear pograming, application area of linear programing problem

application area of linear programing problem

Solve by computational procedure of big – m method, Example 2 Max Z = 3...

Example 2 Max Z = 3x 1 - x 2 Subject to             2x 1 + x 2 ≥ 2             x 1 + 3x 2 ≤ 3             x 2 ≤ 4     &     x 1 ≥ 0, x 2  ≥ 0   A

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