Answer, Operation Research

Assignment Help:
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 week. There are 160 production hours in week. It requires 0.20 & 0.40 hours to produce a ton of grade X & Y papers. The mill earns profits of Rs.200 & Rs.500 per ton of Grade X & Y paper respectively. Formulate this as a Linear Programming Problem.

Related Discussions:- Answer

Linear programming, Ask question #Minimum 100 words acceptNas food produces...

Ask question #Minimum 100 words acceptNas food produces to kinds of popular dark chocolate bars. the banana and coffee. the banana bar costs 0.22 to make and sells of 0.35, where a

Scope, explain the significant and scope of operation research in scientifi...

explain the significant and scope of operation research in scientific management

Liner, #question.A paper mill produces two grades of paper viz., X and Y. B...

#question.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

Tied ranks equal or repeated rank, Tied Ranks Equal or Repeated Rank W...

Tied Ranks Equal or Repeated Rank When  two or more  items  have equal values  it is  difficult  to give ranks  to them. In  that case  the items are given  the average of the

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

Assignment, Six Operators are to be assigned to five jobs with the cost of ...

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

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

LP - Assignment problem, I have looked at Hungarian algorithm to solve assi...

I have looked at Hungarian algorithm to solve assignment problem, but it seems like it is limited to 1-to-1 assignment. I would like to know how to do 1-to-3 assignment.

Level of significance - hypothesis testing , Level of Significance I...

Level of Significance In testing a given  hypothesis  the maximum  probability with which  we would  be willing  to take  risk is called  level of  significance of the  test.

Simple method, solve the LPP using simple method, maximize z= 3x1+2x2 subje...

solve the LPP using simple method, maximize z= 3x1+2x2 subject to 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