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

Operation research, Discuss the methodology of operation research

Discuss the methodology of operation research

Types of correlation - correlation & regression analysis, Types of Correlat...

Types of Correlation 1. Positive Correlation : When the values of two variables move in the same direction .e. when an increase in the values of one variables is ass

Important of demand forecasting, 1. Determination to enter a new territori...

1. Determination to enter a new territories. 2. To decide to enter a new market or not. 3. To determine how much production capacity to be builds up. 4. Helpful in

Video tapes - report writing presentation , Video Tapes Video t...

Video Tapes Video tapes are very information and attention grabbing presentational supports. They are best for illustrating the persons in actions and presen

Dynamic programming models, Dynamic programming may be considered thoutgr...

Dynamic programming may be considered thoutgrowth of mathematical programming and involves the optimization of multistage( sequence of inter related decisions) decision process

Vogel approximation methods, This method is more systematic and orderly th...

This method is more systematic and orderly than least cost method. Here penalties for each column and row of the transportation table are determined, and the row or column with

1, A paper mill produces two grades of paper viz., X and Y. Because of raw ...

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

Problems based on lpp when feasible region is unbounded, Problems based on ...

Problems based on LPP when feasible region is unbounded. 1. Minimize z = 3x + 5y subject to constraints X + y ≥ 2 X + 3y ≥ 3 X, y ≥ 0 script

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

Linear programming, maximize z=3x1+2*2 subject to the constraints x1+x2=4 x...

maximize z=3x1+2*2 subject to the constraints x1+x2=4 x1-x2=2 x1.x2=0

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages