Linear Programming Problem, Operation Research

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

Linear programming., The demand of ice cream during the three summer months...

The demand of ice cream during the three summer months (June, July, and August) at All-Flavors Parlor is estimated at 500,600, and 400 20-gallon cartons, respectively. Two wholesal

Linear problem, #q A paper mill produces two grades of paper viz., X and Y....

#q 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

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

#title.definition of graphical method ., full detailor theory on graphical ...

full detailor theory on graphical method

Linear programming , A paper mill produces two grades of paper viz., X and ...

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 i

PERT, how does it work

how does it work

Graphical solution procedure, Graphical Solution Procedure sample assignmen...

Graphical Solution Procedure sample assignment and solved questions, free examples and solved homework samples for Graphical Solution Procedure in operation research. Question

Integer programming, An integer programming problem is identical to a linea...

An integer programming problem is identical to a linear programming problem except that one or more decision variables are constrained to take integer values. Such problems cannot

Big M method, Maximize p = (3)x + 2y subject to 2x + y 3x + 4y >= 12

Maximize p = (3)x + 2y subject to 2x + y 3x + 4y >= 12

Yates correction for continuity for 2x 2tables , Yates Correction for Cont...

Yates Correction for Continuity for 2x 2Tables If any cell frequency in 2x 2 table isles than 5thenfor the application of X 2 test it is pooled with the preceding or suc

Write Your Message!

Name

Email id

Message

Verfication Code

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!

Submit Assignment

User Account

All Pages