Minimizing Volume with Lagrangian Multipliers & (2,3,4)

  • Thread starter Thread starter circa415
  • Start date Start date
  • Tags Tags
    Volume
AI Thread Summary
The discussion revolves around finding a linear plane that minimizes the volume beneath it while passing through the point (2,3,4) in the first octant. The initial approach involves using Lagrangian multipliers to minimize the volume function V=(1/2)xyz, with the constraint derived from the plane equation 2/a + 3/b + 4/c = 1. Participants clarify that the goal is to maximize the volume abc under the given constraint, leading to a series of equations derived from the gradients of the volume and constraint functions. The relationships between a, b, and c are established as b = (3/2)a and c = (4/3)b = 2a, which are then substituted back into the constraint to solve for the variables. The discussion emphasizes the correct interpretation of the problem and the application of Lagrangian methods to achieve the desired outcome.
circa415
Messages
20
Reaction score
0
I'm supposed to find the linear plane which cuts through first octant and results in the minimum volume underneath the plane. The plane must pass under (2,3,4). I think I need to use Lagrangian multipliers and minimize V=(1/2)xyz.. I'm not sure what the constraint would be though
 
Physics news on Phys.org
ok, after thinking about this some more...

x/a+y/b+z/c=1 will give me a plane where the x, y, z intercepts will be a, b, and c respectively. Therefore if the point passes through 2, 3, 4, then the constraint will have to be 2/a+3/b+4/c = 1

and then V will just be (1/2)abc

and then just apply the lagrangian method

Does that sound like a good way to approach this problem?
 
sounds good to me
 
circa415 said:
I'm supposed to find the linear plane which cuts through first octant and results in the minimum volume underneath the plane. The plane must pass under (2,3,4). I think I need to use Lagrangian multipliers and minimize V=(1/2)xyz.. I'm not sure what the constraint would be though

I don't see how this can HAVE a solution. If your purpose is to get minimum volume and your only requirement is that the plane must "pass under (2,3,4), can't you make the volume arbitrarily small by making the intercepts, x, y, z, arbitrarily close to 0?
 
I'm sure he meant that it goes THROUGH the point :)
 
yeah that's what I meant lol my mistake
 
Then the way you suggested orginally is the way to go. The volume you want to maximize would be abc, of course, and the constraint is 2/a+ 3/b+ 4/c= 1.
Taking the grad of abc give <bc, ac, ab> while taking the grad of (2/a+ 3/b+ 4/c) gives <-2/a2[/sub], -3/b2, -4/c2>.

At the values of a,b,c that maximize the volume while satisfying the constraint, we must have <bc, ac, ab>= &lambda;<-2/a2[/sub], -3/b2, -4/c2> for some &lambda;

That is, bc= -2&lambda;/a2[/sub], ac= -3&lambda;/b2[/sub], ab= -4&lambda;/c2[/sub].

Divide the first equation by the second to get
\frac{bc}{ac}= \frac{-2\lambda}{a^2}\frac{b^2}{3\lambda}
or
\frac{b}{a}= \frac{2b^2}{3a^2}
which is the same as 3a= 2b.

Similarly, dividing the second equation by the third gives
\frac{c}{b}= \frac{3c^2}{4b^2}
which is the same as 4b= 3c.
That is, b= (3/2)a and c= (4/3)b= 2a.
Now put that into 2/a+ 3/b+ 4/c= 1 to solve for a, b, c.
 
This is what I did, I got -2λ/(a^2) = bc, -3λ/(b^2) = ac, -4λ/(c^2)=ab. Mutiply each by a, b, and c respectively and so: -2/a = -3/b = -4/c (take out negative and plug into constraint)
 
Back
Top