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

Formulation of relevant hypotheses and models, Tentative explanations when ...

Tentative explanations when formulated as propositions are called hypotheses. It is very important to state the hypothesis and its anticipated consequences before star

Linear Programming , A Paper mill produces two grades of paper viz. X and ...

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

Transportation, we have three reservoirs with daily supplies of15, 20 and 2...

we have three reservoirs with daily supplies of15, 20 and 25 litres of fresh water respectively. on each day we must supply four cities A B C D whose demands are 8 10 12 and 15 res

Solved the question, #questionthe following Linear Programming Problem usin...

#questionthe following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0 ..

Simplex method, Solve the following Linear Programming Problem using Simple...

Solve the following Linear Programming Problem using Simplex method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

Decision theory., example exercises of these

example exercises of these

Network problem, Consider the following network where the value on each arc...

Consider the following network where the value on each arc represents the capacity of that arc. Use the augmenting path algorithm to find the value of the maximum flow from node 1

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+

ASSIGNMENT, #A paper mill produces two grades of paper viz., X and Y. Becau...

#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

Ge, Ask question #Minimum 100 words what can engineer planner do in métallu...

Ask question #Minimum 100 words what can engineer planner do in métallurgie accepted#

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages