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

Cgj, application&techniques

application&techniques

Linear Programming Problem, A paper mill produces two grades of paper viz.,...

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

Lpp., Paper Mill Produces Two Grades Of Paper Viz x And y Because Of Raw Ma...

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 We

Ge, Ask question #Minimum 100 words what can engineer planner do in métallu...

Ask question #Minimum 100 words what can engineer planner do in métallurgie accepted#

Model, What are the features of blending model

What are the features of blending model

Books - report writing presentation , Books a. One author : Authors...

Books a. One author : Authors last name first name title of books place of publication: publisher copyright data page numbers used. b. Two Author : First author la

CHARACTERISTIC, O.R REPLACES MANAGEMENT BY PERSONALITY

O.R REPLACES MANAGEMENT BY PERSONALITY

Ap problem, Ask question A Company produces 150 cars. But the production ra...

Ask question A Company produces 150 cars. But the production rate varies with the distribution. Production Rate Probability 147 0.05 148 0.10 149 0.15 150 0.20 151 0.30 152 0.15 15

Lp, #question.Solve the following Linear Programming Problem using Simple m...

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

LPP, A FIRM MANUFACTURES HAEDACHE PILLS IN TWO SIZE A AND B

A FIRM MANUFACTURES HAEDACHE PILLS IN TWO SIZE A AND B

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