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

Linear programming, How do I set this problem up for Excel: A National Cred...

How do I set this problem up for Excel: A National Credit Union has $250,000 available to invest in a 12 month commitment. The money can be placed in Treasury notes yielding an 8%

Solve the following linear programming graphically, Problem based on graphi...

Problem based on graphical solution of a given LPP when feasible region is bounded. 1. Solve the following linear programming graphically; Maximize and minimize z = 60x+

Describe the monte carlo simulation, Question A The basic characteristic f...

Question A The basic characteristic feature of Operations Research is that it employs mathematical representations or models to analyse problems. Explain the methodology of Operat

Software, role of computer software operation research

role of computer software operation research

Calculate, A paper mill produces two grades of paper viz X and Y. Because o...

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

Frequency distribution graphs, Frequency Distribution Graphs Freq...

Frequency Distribution Graphs Frequency distribution graphs may be histogram frequency polygon frequency curve ogive curve. 1. Histogram The histogram is draw f

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 X1 - X2 = 2 X1, X2 = 0

LPP, A paper mill produces two grades of paper viz., X and Y. Because of ra...

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

Vogel approximation methods, This method is more systematic and orderly th...

This method is more systematic and orderly than least cost method. Here penalties for each column and row of the transportation table are determined, and the row or column with

Data collection procedure, A series of questionnaire for Delphi were mailed...

A series of questionnaire for Delphi were mailed to the selected experts who meet the criteria that mention in above. The overall purpose of the Delphi technique was to achieve the

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages