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 1.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 grade Y respectively. Formulate this as a linear programming problem.

Related Discussions:- Linear Programming Problem

Periodical article - report writing presentation , Periodical Article ...

Periodical Article A periodical is a publication that is published periodically like a newspaper a magazine and a journal. Usually periodicals have volume numbers and n

Steps involved in hypothesis testing of the mean , Statement of Hypothesis...

Statement of Hypothesis The two hypothesis i ,e, null hypothesis (H 0 ) and Alternative Hypothesis (H 1 ) are so constructed that if one is correct the other is wron

Demerits of range - measure of dispersion , Demerits of Range a.It g...

Demerits of Range a.It gives importance to the two extreme values and is very much affected by the extreme items. b.The range provides no information about the st

Llp, Solve the following Linear Programming Problem using Simple method. Ma...

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

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

Trade literature - classification of documents, Trade Literature: Trad...

Trade Literature: Trade literature consists of documents that give information on the processes and materials involved in the manufacture of a product, various types of produc

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

Simple graph-correlation and regression analysis, Simple Graph The val...

Simple Graph The values of the two variables are plotted on a graph paper. We get two curves one for x variables and another for y variables. These two curves reveal the dir

Tower of hanoi problem, Step 1: Research Towers of Hanoi problem The Tow...

Step 1: Research Towers of Hanoi problem The Towers of Hanoi is a problem frequently used to teach recursive programming techniques. Step 2: Run the assembly code from Hanoim

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

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages