linear programming problems, 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 problems

Chi square test goodness of fit- hypothesis testing, Chi Square  Test Good...

Chi Square  Test Goodness of Fit Chi square test  can be used to find out  how well the  theoretical distribution fit  with the  empirical distribution  of observed distribut

Stratified sample size - sampling size, Stratified Sample Size The  sa...

Stratified Sample Size The  sampling  study  has depended  much on the stratified sample  to reduce  the sampling  error, samples  size may have a number of strata or  cluster

One sample sign test - hypothesis testing , One Sample sign Test In...

One Sample sign Test In a one  sample  test the  null  hypothesis μ = μ 0 against an  appropriate alternative on the basis of a random sample of size n we replace each sam

Mean deviation - measure of dispersion, MEAN DEVIATION Mean  deviati...

MEAN DEVIATION Mean  deviation of a series is the arithmetic  average of the  deviations of various  items  from the  median  or mean  of that series. Median is preferred

Advantages of operations research, Operation Research may be regarded as a...

Operation Research may be regarded as a tool which is utilized to increase the effectiveness of the management decisions. O R is objective supplement to the subjective feeling

Research paper, Research Paper Overview Research Topic: •    Research ...

Research Paper Overview Research Topic: •    Research the effects of federal mandates in your state.  Examples include the Americans with Disabilities Act, the No Child Left B

Linear programming, solve the following linear programming problem using si...

solve the following linear programming problem using simplex method maximize z=3x1+2x2 subject to the constraints: x1+x2 x1+x2 x1,x2>=0

Purchasing, need of detailed information about the topic

need of detailed information about the topic

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