|
The OPTIMUS Local Optimization Module has 2 robust algorithms - Sequential Quadratic Programming (SQP) and Generalized Reduced Gradient (GRG). They typically converge quickly to a local optimum.
These algorithms require the definition of an objective function, bounds for the input parameters and, if needed, a set of constraints on the outputs. These local optimization algorithms are available for solving general constrained optimization problems. Sensitivity-based algorithms that use the sensitivities (or gradients) of the objective function, and the constraints, are available to find a local optimum in an efficient way.
|
