Numerical techniques-Linear programming(graphical method)

In summary: B paper is being produced. Then, the objective function becomes: Z = 20A + 50B. Since A and B are both integers, the constraints become: A <= 400 and B <= 300. Since the mill can produce at most 400 tonnes of each grade of paper, the maximum profit is when Z = 800(400+300).
  • #1
Monsterboy
303
96

Homework Statement


Two grades of paper,grade A and grade B,are produced by a paper mill.It takes 12 minutes and 24 minutes to produce a ton of these two grades of papers respectively,with corresponding profits of $20 and $50. The mill works for 160 hours in a week and has the capacity of producing 400 tonnes of grade A and 300 tonnes of grade B paper.Find the quantity of each of these grades of paper to be produced so that the profit is maximum.

Homework Equations



See below

The Attempt at a Solution



well ,we need to find the max profit
assume 'Z' as profit and the equation for Z is Z = 20A + 50B (Objective function)
where A,B are number of grade A and grade B papers
we have to maximize Z right??

i am not sure about how to put (inequality/equality) constraints.
(400x10^3)A +(300x10^3)B <=160 ??

i don't how to relate the mass(tonnes) of these papers with time(hrs/min) in the constraints
 
Physics news on Phys.org
  • #2
Monsterboy said:

Homework Statement


Two grades of paper,grade A and grade B,are produced by a paper mill.It takes 12 minutes and 24 minutes to produce a ton of these two grades of papers respectively,with corresponding profits of $20 and $50. The mill works for 160 hours in a week and has the capacity of producing 400 tonnes of grade A and 300 tonnes of grade B paper.Find the quantity of each of these grades of paper to be produced so that the profit is maximum.

Homework Equations



See below

The Attempt at a Solution



well ,we need to find the max profit
assume 'Z' as profit and the equation for Z is Z = 20A + 50B (Objective function)
where A,B are number of grade A and grade B papers
we have to maximize Z right??
Right.
Monsterboy said:
i am not sure about how to put (inequality/equality) constraints.
(400x10^3)A +(300x10^3)B <=160 ??
Not right.
How long, in hours, does it take to make a tonne of grade A paper? How long to make a tonne of grade B paper? The mill operates only 160 hours a week, so that is one constraint on how much paper can be made.

The other constraints are that the mill can make at most 400 tonnes of grade A paper and 300 tonnes of grade B paper. These are two other constraints.

Also, the amount of paper of either grade must be nonnegative.

Monsterboy said:
i don't how to relate the mass(tonnes) of these papers with time(hrs/min) in the constraints

As an aside, "ton" and "tonne" are not the same, and you have used both. The first is 2000 lb. while the second is 1000 kg, or 2200 lb.
 
  • #3
As an aside on your aside Mark44, "ton" is even more complicated. A ton can be either 2000lb or 2240lb, depending on where you are - possibly other options that I don't know about too. A tonne is exactly 1000kg.
 
  • #4
Monsterboy said:

Homework Statement


Two grades of paper,grade A and grade B,are produced by a paper mill.It takes 12 minutes and 24 minutes to produce a ton of these two grades of papers respectively,with corresponding profits of $20 and $50. The mill works for 160 hours in a week and has the capacity of producing 400 tonnes of grade A and 300 tonnes of grade B paper.Find the quantity of each of these grades of paper to be produced so that the profit is maximum.

Homework Equations



See below

The Attempt at a Solution



well ,we need to find the max profit
assume 'Z' as profit and the equation for Z is Z = 20A + 50B (Objective function)
where A,B are number of grade A and grade B papers
we have to maximize Z right??

i am not sure about how to put (inequality/equality) constraints.
(400x10^3)A +(300x10^3)B <=160 ??

i don't how to relate the mass(tonnes) of these papers with time(hrs/min) in the constraints


Always try to approach such problems systematically: write down the definitions of your decision variables (including proper units); write out the constraints carefully---don't write down random formulas, think things through systematically; and write out the objective to be maximized or minimized. Always try to avoid (if you can) mixtures of numbers of very different magnitudes in left-hand-side coefficients when modelling (especially in large models), because the problem is going to be solved on a computer using finite precision arithmetic, and you want to reduce the effects of roundoff effects (which can be VERY serious in large linear models if you are not careful).

So, first of all: choose sensible units, such as TA = tons of grade A paper to produce per week and TB = tons of grade B per week. That makes your constraint nicer: weekly time used = 12TA + 24TB (minutes). How many minutes per week are available? (You need to be careful: if you use 'minutes' on the left you need to use 'minutes' on the right.) What are the limits on TA and TB? What is the profit ($/week) for given values of TA and TB?

RGV
 
  • #5
It might be simpler to express the time for production in hours: 0.2 hours for a tonne of A and 0.4 hours for a tonne of B.

The problem doesn't state explicitly that the mill can only produce one product at a time but I'm assuming that must be so, otherwise it is not an interesting problem.
 

Related to Numerical techniques-Linear programming(graphical method)

1. What is linear programming?

Linear programming is a mathematical optimization technique used to find the maximum or minimum value of a linear objective function, subject to a set of linear constraints. It is commonly used in business and economics to make optimal decisions.

2. What is the graphical method in linear programming?

The graphical method in linear programming is a visual approach to solving linear programming problems. It involves plotting the constraints and objective function on a graph and finding the optimal solution by identifying the intersection points of the lines.

3. What are the advantages of using the graphical method in linear programming?

The graphical method is relatively easy to understand and can provide a quick and intuitive solution to simple linear programming problems. It also allows for visualization of the problem, making it easier to identify any potential issues or alternatives.

4. When is the graphical method not suitable for solving linear programming problems?

The graphical method is not suitable for solving complex linear programming problems with a large number of variables and constraints. It also cannot handle problems with non-linear objective functions or constraints.

5. What are the limitations of the graphical method in linear programming?

The graphical method can only provide an approximate solution, as the intersection points on the graph may not be exact. It also does not take into account any additional factors or uncertainties that may affect the optimal solution.

Similar threads

Replies
17
Views
2K
  • Calculus and Beyond Homework Help
Replies
3
Views
2K
  • Calculus and Beyond Homework Help
Replies
1
Views
2K
  • Precalculus Mathematics Homework Help
Replies
2
Views
3K
  • Calculus and Beyond Homework Help
Replies
2
Views
4K
  • Precalculus Mathematics Homework Help
Replies
2
Views
3K
  • Precalculus Mathematics Homework Help
Replies
4
Views
4K
  • Engineering and Comp Sci Homework Help
Replies
1
Views
6K
  • Calculus and Beyond Homework Help
Replies
3
Views
20K
  • Set Theory, Logic, Probability, Statistics
Replies
1
Views
3K
Back
Top