Express Langrange constraint that an expression*cannot* equal a value

Click For Summary
SUMMARY

The discussion centers on expressing a constraint in Lagrangian optimization where a parameter must not equal a specific value, specifically x_3 ≠ 1. The consensus is that this situation is best handled by restricting the domain of the function f(x) rather than applying a direct constraint on x_3. Participants agree that one should extremize f normally and subsequently reject any solutions where x_3 equals 1, confirming the practical approach to this optimization problem.

PREREQUISITES
  • Lagrangian optimization techniques
  • Understanding of domain restrictions in mathematical functions
  • Familiarity with extremization methods
  • Basic knowledge of optimization problems
NEXT STEPS
  • Study domain restrictions in mathematical optimization
  • Learn about Lagrangian multipliers and their applications
  • Explore rejection sampling techniques in optimization
  • Investigate advanced optimization algorithms for constrained problems
USEFUL FOR

Mathematicians, optimization specialists, and anyone involved in advanced problem-solving in fields such as engineering or economics will benefit from this discussion.

X89codered89X
Messages
149
Reaction score
2
I have an optimization where I'd like to express the idea that some of my parameters cannot equal a certain value

e.g... [tex]max \ f(x) = ...[/tex] s.t. [tex]x_3 \neq 1[/tex]

Is there a standard method to solve this using lagrangian optimization?

Thanks.
 
Physics news on Phys.org
What you are doing there is best described as restricting the domain of [itex]f[/itex] rather than putting a constraint on [itex]x[/itex]. You just have to extremize [itex]f[/itex] in the ordinary way and reject any maximum which has [itex]x_3 = 1[/itex].
 
Ah that is a good point. I had suspected in practice that I would just have to do a rejection like that, but you also gave tasty frontal-lobe-esque reasoning. Thanks!
 

Similar threads

Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 16 ·
Replies
16
Views
4K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 5 ·
Replies
5
Views
4K