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

Mean deviation - measure of dispersion, MEAN DEVIATION Mean deviati...

MEAN DEVIATION Mean deviation of a series is the arithmetic average of the deviations of various items from the median or mean of that series. Median is preferred

Scope of operation research, scope of operation research in management

scope of operation research in management

#titleAssignment Problem.., Six Operators are to be assigned to five jobs w...

Six Operators are to be assigned to five jobs with the cost of assignment in Rs. given in the matrix below. Determine the optimal assignment. Which operator will have no assignment

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

Drurys principles, Drury's Principles: The basic principle, which stil...

Drury's Principles: The basic principle, which still governs the selection of reading material for a library, was enunciated by Drury in 1930. It states: "To provide the righ

Scope of operations research, Scope of the OR techniques can be derived ...

Scope of the OR techniques can be derived in followings various importance fields: 1. In Agriculture : With the explosion of population and consequent shortage of food O

Action phase - phase of operation research, The action phase consists of ...

The action phase consists of making recommendations for remedial action to those who first posed the problem and who control the operations directly. These recommendatio

Decision tree, ppt on decision tree

ppt on decision tree

Solve by simplex method, Solve by simplex method Maximize Z = 5...

Solve by simplex method Maximize Z = 5x 1 + 3x 2 Subject to 3x 1 + 5x 2 ≤ 15 5x 1 + 2x 2 ≤ 10 & x 1 ≥ 0, x 2 ≥ 0 [Ans. Max Z = 235/19

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+

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages