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

Inventory management, models of inventory management

models of inventory management

Game Theory, Task1:- A company is currently involved in negotiation with it...

Task1:- A company is currently involved in negotiation with its union on the upcoming wage contract. Positive signs in the table represent wage increase while negative sign represe

Describe the demand curve, The following equation gives Jane's linear deman...

The following equation gives Jane's linear demand curve for visits to a nearby national park. Q is the number of visits per week and P represents the price of a pass (price per vi

Conflicts of interest and related change in medical research, Conflicts of ...

Conflicts of Interest and Related Change in Medical Research The significant increase in private industry drug studies has spawned three other changes in medical research: med

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.

Categorizing operations research problems, what are the categorization of o...

what are the categorization of operations research problems?

Uses of mean deviation - measure of dispersion, Uses of Mean Deviation...

Uses of Mean Deviation Mean Deviation is rarely being used as a measure of dispersion. But due to easy and simplicity in calculation. It is rather useful in busin

Explain what do you understand by dynamic programming, Question: (a) (i...

Question: (a) (i) Explain what do you understand by ‘Dynamic Programming'. (ii) Describe the dynamic programming approach to solve the shortest route problem. (iii) Outli

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

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

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages