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

#title.L.L.p, #use the simple method to solve the following L.P.P. Maximi...

#use the simple method to solve the following L.P.P. Maximize Z =4X1 +10X2 subject to constraints, 2X1 +X2 2X1+5X2 2X1 +3X2 X1,X2 > 0

Scope, Scope of operation research?

Scope of operation research?

LLP, 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

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

Software, role of computer software in operation research

role of computer software in operation research

Rehearse - report writing presentation , Rehearse Making presentat...

Rehearse Making presentation is not simple. It is extremely important for us to realize the sanctity of rehearsing to improve the quality of the presentation. Unless

Non-documentary sources and institutional resources, Non-Documentary Source...

Non-Documentary Sources: On the other hand, non-documentary sources are institutional and human resources, both of which are important links in the information-transfer chain.

Game thoery, In a rectangular game, pay-off matrix of player A is as follow...

In a rectangular game, pay-off matrix of player A is as follows: i) Solve the game. ii) Write down the pay-off matrix of B and then, solve the game.

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

Determine phases-states-decisions and probability , G. Ambler has € 10000 ...

G. Ambler has € 10000 available for a second hand car, but would like to buy a fast car that costs € 25000. He needs the money for that car quickly, and would like to increase his

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages