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

Advantages of mean deviation - measure of dispersion, Advantages of Mea...

Advantages of Mean Deviation a.It is based on all the observation . any change in any item would change the value of mean deviation. b.Mean deviation is less aff

Help me please , This year Jan Rich, who is ranked number one in women''s s...

This year Jan Rich, who is ranked number one in women''s singles in tennis, and Marie Wacker, who is ranked number three, will play 4 times. If Marie can beat Jan 3 times, she will

Survey method, This method involves a systematic and comprehensive study...

This method involves a systematic and comprehensive study of a particular community organization group etc, with a view to the analysis of a social problem and the presen

Linear regression, regression line drawn as y=c + 1075x, when x was 2, and ...

regression line drawn as y=c + 1075x, when x was 2, and y was 239, given that y intercept was 11. calculate the residual

Characteristic of operation research, explain characteristic of operation o...

explain characteristic of operation of research.

A paper mill, A paper mill products two grade of paper viz., X & Y. Because...

A paper mill products two grade of paper viz., X & Y. Because of raw material restriction, it cannot produce more than 400 tons of grade X paper & 300 tons of grade Y paper in a we

Why the dual formulation?, Dual formulation is done for a number of r...

Dual formulation is done for a number of reasons. The solution to a Dual problem provides all essential information about the solution to the Primal problem. A so

Probability distribution , Normal 0 false false false E...

Normal 0 false false false EN-IN X-NONE X-NONE PROBABILITY DISTRIBUTION

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

Linear programing, Maximize6x1+8x2+5x3,st,labour3x1+4x2+5x3 =0 then brefly ...

Maximize6x1+8x2+5x3,st,labour3x1+4x2+5x3 =0 then brefly explain x1,x2,x3;term labour,metal&plastic;the160hours;x1,x2&x3>=0

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages