Crazy optimization/Lagrange questino

  • Thread starter daBish
  • Start date
In summary, the question is asking to find the minimum distance from the origin using Lagrange method with the constraint equation z^2-xy+1=0. The solution involves using F= x^2+ y^2+ z^2 as the distance formula and G= z^2-xy+1=0 as the constraint equation. The possible points for minimum distance are (1,1,0) and (-1,-1,0) which both have a distance of √(2) from the origin.
  • #1
daBish
2
0
Ok this is the question I had on a test today:

given this constraint equation z^2-xy+1=0 find the min. distance from the origin using Lagrange method.

so basically you use D^2=x^2+y^2+z^2 as the other equation. however, it basically goes nuts from there. especially if you set it up like you are suppose to.
Fx=(lambda)Gx
Fy=(lambda)Gy
Fz=(lambda)Gz
g=0

(capitals are partial derivatives)

with f as the distance formual and g as the constraint

this one sucks but if someone could help it would be greatly appreciated
 
Physics news on Phys.org
  • #2
Try not to minimize [itex]D=\sqrt{x^2+y^2+z^2}[/itex], but [itex]D^2=x^2+y^2+z^2[/itex].
 
  • #3
1. Why was this posted under "differential equations"?

2. You want to minimize F= x2+ y2+ z2 subject to the condition G= z^2-xy+1=0.
Okay, grad F= 2xi+ 2yj+ 2zk= λgrad G= &lambda(-yi- xj+ 2zk)
so 2x= -λy, 2y= -λx, and 2z= -2λz

Divide the first equation by the second, x/y= y/x so x2= y[/sup]2[/sup] and y= x or y= -x.
From 2z= -2λz, either z= 0 or &lambda= -1.

With x= y, z= 0, since z^2-xy+1=0, we have -x2+ 1= 0 so x= +1 or -1:
(1, 1, 0) and (-1,-1,0) are possible points.

With x= -y, z= 0, since z^2-xy+1=0, we have x2+ 1=0 which is impossible.

If z is not 0, then &lambda= -1 so 2x= -λy become 2x= y and 2y= -λx becomes 2y= x: 2y= 2(2x)= 4x= x so x= y= 0. In that case z^2-xy+1=0 becomes z2+ 1= 0 which is impossible.

The two minimum distance points are (1,1, 0) and (-1,-1,0). The are both distance √(2) from (0,0,0).
 

What is crazy optimization?

Crazy optimization is a problem-solving technique that involves finding the best possible solution to a given problem, often using mathematical methods. It is called "crazy" because it can involve complex and unconventional approaches to optimization.

What is the Lagrange question?

The Lagrange question, also known as the Lagrange problem or Lagrangian optimization, is a specific type of crazy optimization that involves optimizing a function subject to constraints. It is named after mathematician Joseph-Louis Lagrange.

What are the main steps in crazy optimization?

The main steps in crazy optimization include defining the problem and its constraints, formulating a mathematical model, finding the optimal solution using mathematical techniques, and verifying the solution's validity and accuracy.

What types of problems can be solved using crazy optimization?

Crazy optimization can be used to solve a wide range of problems in various fields, including engineering, economics, computer science, and physics. It is especially useful for complex and non-linear problems that cannot be easily solved using traditional methods.

What are some common techniques used in Lagrange question?

Some common techniques used in Lagrange question include the method of Lagrange multipliers, KKT conditions, and convex optimization. These techniques involve using mathematical concepts such as derivatives, gradients, and convexity to find the optimal solution to a constrained optimization problem.

Similar threads

  • Calculus and Beyond Homework Help
Replies
8
Views
442
  • Calculus and Beyond Homework Help
Replies
4
Views
820
  • Calculus and Beyond Homework Help
Replies
5
Views
2K
  • Calculus and Beyond Homework Help
Replies
8
Views
1K
  • Advanced Physics Homework Help
Replies
9
Views
1K
  • Advanced Physics Homework Help
Replies
2
Views
998
Replies
9
Views
2K
Replies
5
Views
1K
  • Advanced Physics Homework Help
Replies
7
Views
2K
Back
Top