00:02
And in this case, we again wanna, let's see, is it missing, maximize or minimize, or what do we wanna do, maximize x times y times z, subject to this constraint, which i don't know what kind of surface that is, but we can obviously plot it if we wanted to, but it's x times y plus two x times z plus two y times z minus eight equals zero.
00:26
That's our constraint equation, the constraint function is just this.
00:30
So g is x times y times y times, z plus lambda times our constraint function.
00:38
And we can take derivatives with respect to x, y, z, and lambda, and these are just polynomials so they aren't too bad.
00:44
And so we get, with derivative respect to x is y times z plus lambda times y plus 2 z and that equals 0.
00:54
So at the y we get x z plus lambda times x plus x plus x and we set that to zero.
01:00
And we set to z we get x y plus 2 lambda times x plus y and we set that equal to 0.
01:05
And we set that respect to lambda, and we just get our constraint equation back when we set it equal to zero.
01:13
So again, we have four equations or four unknowns.
01:16
They're non -linear.
01:17
So it means that there's possibly multiple solutions here.
01:22
And we have, you know, these are always going to be linear in lambda.
01:29
So it's always easy...