Multivariable Constrained Optimization

Click For Summary
To solve the multivariable constrained optimization problem of minimizing (a+b+c) under the specified constraints, methods such as Lagrange multipliers or numerical optimization techniques like Sequential Quadratic Programming (SQP) can be effective. The constraints involve ensuring that the distance from a point (x, y, z) to (a, b, c) lies within a specified range defined by R(z) and r(z), while also adhering to the bounds on z. It is crucial to clearly define the functions R(z) and r(z) for accurate computation. Utilizing software tools like MATLAB or Python's SciPy library can facilitate the optimization process. Proper formulation of the problem and constraints will lead to a successful solution.
vaibhavphalak
Messages
2
Reaction score
0
hi
i want to find values of a,b,c such that..

Minimize (a+b+c)
constrained to

(x-a)^2 + (y-b)^2 + (z-c)^2 less than equal to R(z)

(x-a)^2 + (y-b)^2 + (z-c)^2 greater than equal to r(z)

can anyone help me solving this?? which method should b used for better computation??
 
Mathematics news on Phys.org
in the above problem," x,y,z" are given and
one more constraint:

-z1 < z < z2

z1,z2 > 0.
 
Here is a little puzzle from the book 100 Geometric Games by Pierre Berloquin. The side of a small square is one meter long and the side of a larger square one and a half meters long. One vertex of the large square is at the center of the small square. The side of the large square cuts two sides of the small square into one- third parts and two-thirds parts. What is the area where the squares overlap?

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 7 ·
Replies
7
Views
2K
Replies
2
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K