(Constrained) Numerical Optimization Problem (NOP)
Category : Code
A general constrained numerical optimization problem (NOP) may be written as follows: where is the objective function and each is a constraint function to be satisfied, and and are constants. Each function can be nonlinear and non-smooth. If there is no constraint (i.e., ), then the problem becomes an unconstrained optimization problem. NOP Instance Implementation
Read More