I'm not sure what you want to know. The built-in mutationadaptfeasible function is briefly described here:
"Adaptive Feasible (mutationadaptfeasible), the default mutation function when there are constraints, randomly generates directions that are adaptive with respect to the last successful or unsuccessful generation. The mutation chooses a direction and step length that satisfies bounds and linear constraints."
In other words, the mutation strictly satisfies bounds and linear constraints. It does not attempt to satisfy nonlinear constraints. It satisfies the bounds and linear constraints by internally using a QR algorithm to generate trial points along the active set boundary and then checking for feasibility of the resulting steps to ensure that all constraints remain satisfied. You can read the code by entering
edit mutationadaptfeasible
Alan Weiss
MATLAB mathematical toolbox documentation
