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

Please semd ans., A paper mill products two grade of paper viz., X & Y. Bec...

A paper mill products two grade of paper viz., X & Y. Because of raw material restriction, it cannot produce more than 400 tons of grade X paper & 300 tons of grade Y paper in a we

Ques, Ask questb. A Company produces 150 cars. But the production rate vari...

Ask questb. A Company produces 150 cars. But the production rate varies with the distribution. Production Rate 147 148 149 150 151 152 153 Probability 0.05 0.10 0.15 0.20 0.30 0.15

Both LP and PIP, marginal rate of substitution, degeneracy and degenerate ...

marginal rate of substitution, degeneracy and degenerate solution

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

write down any two assumption of L.P

LLp, A paper mill produces two grades of paper viz., X and Y. Because of ra...

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

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

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

Sing test- hypothesis testing, SING TEST The sign test  is the simples...

SING TEST The sign test  is the simplest  of the  parametric  tests. Its name comes  from the  fact  that it is based  on the direction ( or sings  for  pluses or minuses ) of

LINEAR PROGRAMMING, SOLVE THE FOLLOWING LP USING SIMPLE METHOD MAXIMIZE Z=...

SOLVE THE FOLLOWING LP USING SIMPLE METHOD MAXIMIZE Z=3X1+2X2 SUBJECT TO CONSTRAINT X1+X2 X1-X2 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