solves the linear complementarity problem
solves the linear programming problem
solves the linear programming problem
solves the mixed integer linear programming problem
performs nonlinear optimization by conjugate gradient method
performs nonlinear optimization by double-dogleg method
approximates derivatives by finite-differences method
computes feasible points subject to constraints
computes hybrid quasi-Newton least squares
computes Levenberg-Marquardt least squares
performs nonlinear optimization by Nelder-Mead simplex method
performs nonlinear optimization by Newton-Raphson method
performs nonlinear optimization by Newton-Raphson ridge method
performs nonlinear optimization by quasi-Newton method
performs nonlinear optimization by quadratic method
performs nonlinear optimization by trust-region method
lists the nonlinear optimization and related subroutines in SAS/IML software