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

Dual of the lpp, the dual form of the following lpp min z=3x1+2.5x2 constra...

the dual form of the following lpp min z=3x1+2.5x2 constraints:2x1+4x2>=40, 3x1+2x2>=50 and x1,x2>=0

Model, What are the features of blending model

What are the features of blending model

Closed loop, Write a note on tracing a closed loop. What are the characteri...

Write a note on tracing a closed loop. What are the characteristic features of a closed loop?

LInear Programming, - A paper mill produces two grades of paper viz., X an...

- 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 pape

Theoretical framework, Ask questiAvatars are virtual characters that can be...

Ask questiAvatars are virtual characters that can be used as representatives of a company that is using the Internet as a distribution channel. For instance, avatars can be used as

Determining sample size for estimating poportions, Determining Sample Size ...

Determining Sample Size for Estimating poportions It is  necessary  to determining  the sample size for a  problem involving  proportions. This deals  with the percentage of f

Expected value analysis, Profitable Casino Corp. (PCC) is a Harrah's wannab...

Profitable Casino Corp. (PCC) is a Harrah's wannabe, intent on mimicking Harrah's analytical marketing techniques.  For example, PCC issues virtually all gamers a PCC "Rewards" car

Simplex method, Solve the following Linear Programming Problem using Simple...

Solve the following Linear Programming Problem using Simplex method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

Convenience sampling - sampling decisions , Convenience  Sampling In...

Convenience  Sampling In  convenience  sampling  selection the researcher chooses the  sampling  units on the   basis of convince or  accessibility. It is  called  accidental

Operations research 2, management wants to know how many supervisors should...

management wants to know how many supervisors should be hired, and what could be the optimum workload distribution to be applied, given a number of constraints

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