JasonB said:
Homework Statement
An alloy of gold, aluminum, and copper has a density of 10,000 kg/m3. The alloy contains at least 10% aluminum and 5% copper by mass. The densities for the three metals are respectively ρAu = 19320 kg/m3, ρAl = 2712 kg/m3, ρCu = 8940 kg/m3. Find the maximum and minimum percentage of gold by mass. Show all work and carefully explain your logic.
Homework Equations
ρ=Mass/Volume
Lagrange Multipliers
The Attempt at a Solution
I am struggling to form the initial functions. I suspect the professor intends for us to use Lagrange multipliers, and I am confident I can find the gradients and drudge through the resulting algebra, but I am struggling to get started.
I understand density is mass per volume, and that percent by mass is the mass of a component divided by the total mass.
I imagine I will take the three metals to be the variables x, y, and z. And I suspect optimizing over a single cubic meter would be the best approach.
I found some guidance online suggesting I use the sum of the masses and the sum of the volumes. This gives me:
MAu = ρAu * VAu
MAl = ρAl * VAl
MCu = ρCu * VCu
MAu + MAl + MCu = 10,000 kg
ρAu * VAu + ρAl * VAl + ρCu * VCu = 10,000 kg
19320VAu + 2712VAl + 8940VCu = 10,000 kg
and
VAu + VAl + VCu = 1 m3
Both of these seem to be constraint equations and I am confused as to what the function to be optimized will look like.
Other constraints would be: (assuming optimization over a single cubic meter)
MCu ≥ 500 kg
MAl ≥ 1000 kg
MAu ≤ 8500 kg
The Lagrange Multiplier method requires two functions. One function constrained by another function.
I have found help here before, but this is my first post. I would appreciate any insight regarding the initial functions. Thank you.
You should not have a constraint ##M_{Au} \leq 8500## because it is already implied by the other two restrictions on aluminum and copper. It is an example of a redundant constraint. Including it just makes the problem harder to solve and for no good reason. Of course, you do need the constraint ##V_{Au} \geq 0## in order to prevent a negative value in the minimization problem.
As it stands you have a simple linear programming problem which is readily solvable using non-calculus high-school algebra methods; Google “simplex method” to see many examples. However, if you do insist on approaching it using calculus and Lagrange multipliers, you should realize that it is trickier than you may think. The inequality constraints prevent you from just setting derivatives to zero, so you need to resort to the so-called “Karush-Kuhn-Tucker” (KKT) conditions. You can do it, but it will take much more work than just using the simplex method of linear programming. For a look at the KKT conditions, see, eg.,
http://www.onmyphd.com/?p=kkt.karush.kuhn.tucker or http://ocw.mit.edu/courses/mechanical-engineering/2-854-introduction-to-manufacturing-systems-fall-2010/lecture-notes/MIT2_854F10_kkt_ex.pdf .
It is easiest to just use the simplex method of linear programming in this case. In fact, you can reduce it to a two-dimensional problem and so solve it graphically. Basically, you can use one of the constraints to express a variable in terms of the other two, then substitute that expression everywhere else that variable appears. The result will be a problem having one equality and three inequalities in two variables. Therefore, you can plot the feasible region of the constraints as a polygon in a two-dimensional space. Then you can look at the geometry to get the maximal and minimal solutions. See, eg., http://spartan.ac.brocku.ca/~pscarbrough/scarb-alp-burch/Chapters%201-24-16.htm or
http://ir.library.oregonstate.edu/xmlui/bitstream/handle/1957/20084/em8719-e.pdf for some simple examples of the method.
Finally: lose the units. Define the variables as so many m^3, etc, so there is no m^3 unit attached to the volume constraint, and define the masses as being measured in kg, so there are no kg units attached to the other constraints. In other words, just write ##V_{Au} + V_{Al} + V_{Cu} = 1##, etc. It is important to do this because if you were to submit the problem (exactly as you wrote it) to a solver, it would choke.