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

Non measurable human factors, Operation research makes no allowance for in...

Operation research makes no allowance for intangible factors such as skill attitude vigor of the management people in taking decisions but in many instances success or fail

Liner programming problem, A constraints in an LPP restricts? (Value of obj...

A constraints in an LPP restricts? (Value of objective function,Value of decision variable,Use of available resources, uncertainty of optimum value) please help me to find out righ

OPTIMAL ASSIGNMENT., Six Operators are to be assigned to five jobs with the...

Six Operators are to be assigned to five jobs with the cost of assignment in Rs. given in the matrix below. Determine the optimal assignment. Which operator will have no assignment

Need of research proposal, Need Proposals are written for various reas...

Need Proposals are written for various reasons. They are prepared for different reasons which vary to the extent of details expected, but like research reports, the proposal a

Linear regression, regression line drawn as y=c + 1075x, when x was 2, and ...

regression line drawn as y=c + 1075x, when x was 2, and y was 239, given that y intercept was 11. calculate the residual

Determine phases-states-decisions and probability , G. Ambler has € 10000 ...

G. Ambler has € 10000 available for a second hand car, but would like to buy a fast car that costs € 25000. He needs the money for that car quickly, and would like to increase his

Linear programming problem, Solve the following Linear Programming Problem ...

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

Competitive models, These models have been developed to establish a trade ...

These models have been developed to establish a trade off between costs of providing and the waiting time of a customer in the queuing system. Constructing a model entails desc

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