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

Sources of stress and job burnout, QUESTION Discuss the major sources o...

QUESTION Discuss the major sources of stress and job burnout and outline the strategies for managing stress. QUESTION How can you use the „Johari Window Model? as a

Explain research terminology, Q. Explain Research Terminology? Research...

Q. Explain Research Terminology? Research Terminology - Independent and Dependent variables: There are many practical problems in which the values of one variable depend upon t

Manufacturing operation , You are a manager at a medium sized manufacturing...

You are a manager at a medium sized manufacturing operation that sells a customized product directly to the consumers and the data pattern is linear but it can have the occasion ra

Simo chart flow diagram , SIMO Chart Flow Diagram The  flow  diagram  ...

SIMO Chart Flow Diagram The  flow  diagram  is a drawing  indicating  the paths  of men  materials  or components on a scale  plan of  the work  area, department or  factory.

SMU 2nd Semester, A paper mill produces two grades of paper viz., X and Y. ...

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

Game theory , 3 In a rectangular game, pay-off matrix of player A is as f...

3 In a rectangular game, pay-off matrix of player A is as follows:

SIMPLEX METHOD, Solve the following Linear Programming Problem using simple...

Solve the following Linear Programming Problem using simple method Maximize Z= 3x1 + 2x2 Subject to the constraints: X1 + X2 = 4

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!

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