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

Word problems based on formulation of linear programming, Word problems bas...

Word problems based on formulation of linear programming problems. 2. A manufacturer produces nuts and bolts for industrial machinery. It takes 1 hour of work on machine 1 an

Goal programming, Goal Programming This provides a more realistic model...

Goal Programming This provides a more realistic model. In a modern setting, profit maximization may not be the only objective of a business concern. Other objectives or goals c

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

Model, classification

classification

Stepping stone method, This is a procedure of determining the potential i...

This is a procedure of determining the potential if any for improving each of the non basic variables in terms of the objective function. To determine this potential each of

Scope, Scope of operations research

Scope of operations research

Operation reaserch, 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

LP - Assignment problem, I have looked at Hungarian algorithm to solve assi...

I have looked at Hungarian algorithm to solve assignment problem, but it seems like it is limited to 1-to-1 assignment. I would like to know how to do 1-to-3 assignment.

Problems based on lpp when feasible region is a line segment, Problems base...

Problems based on LPP when feasible region is a line segment or it does not exist. 1. Maximize z = 2x+3y subject to the constraints X + y ≤ 1 X + y ≥ 3 X, y ≥ 0

Variables, Variables A concept which varies is variable. These can be ...

Variables A concept which varies is variable. These can be different in quantitative values. For example, weight, height, income are examples of variables. Qualitative phenom

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages