In the context of optimization problems, which of the following methods is typically used to find the maximum or minimum of a nonlinear function subject to constraints?
- Simplex Method
- Gradient Descent
- Lagrange Multipliers
- Branch and Bound
1
Only 1 is correct
2
Only 3 is correct.
3
1 and 2 both
4
All of the above
5
Question Not Attempted