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

Probability distribution , Normal 0 false false false E...

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

Linear programming , #questionQuestion. a paper mill produces two grades o...

#questionQuestion. a paper mill produces two grades of paper viz.,xand y.Bacause of raw material restrictions, it cannot produce more than 400 tones of grade x paper and 300 tons

Regression equations - correlation regression analysis, Regression Equation...

Regression Equations The   regression equations express the regression line. As there are two regression lines so there  are two  regression  equations. The regression equatio

Seven step to a successful presentation, Seven Step to a Successful Present...

Seven Step to a Successful Presentation There  are seven  basic  step which  need to  kept  in mind at the  time of  making  a presentation. How  successful one  is at eh end

Decide upon the objective , Decide upon  the Objective  What is it...

Decide upon  the Objective  What is it that you  aim to  achieve  the end  of the  presentation ? your  objective  should  be crystal  clear. Do  not stray or move  a ways

Differentiate among descriptive and inferential analysis o, Question 1 ...

Question 1 A) Differentiate among descriptive and inferential analysis of data B) Describe with examples various measures of Central Tendency Question 2 The chi-square

Tower of hanoi problem, Step 1: Research Towers of Hanoi problem The Tow...

Step 1: Research Towers of Hanoi problem The Towers of Hanoi is a problem frequently used to teach recursive programming techniques. Step 2: Run the assembly code from Hanoim

Linear programming, maximize z=3x1+2x2 subgect to the constraints x1+x2 x1-...

maximize z=3x1+2x2 subgect to the constraints 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