| E04MXF
| Reads MPS data file defining LP, QP, MILP or MIQP problem |
| E04NCF
| Convex QP problem or linearly-constrained linear least squares problem (dense) |
| E04NFF
| QP problem (dense) |
| E04NKF
| LP or QP problem (sparse) |
| E04NQF
| LP or QP problem (suitable for sparse problems) |
| E04UCF
| Minimum, function of several variables, sequential QP method, nonlinear constraints, using function values and optionally first derivatives (comprehensive) |
| E04UFF
| Minimum, function of several variables, sequential QP method, nonlinear constraints, using function values and optionally first derivatives (reverse communication, comprehensive) |
| E04USF
| Minimum of a sum of squares, nonlinear constraints, sequential QP method, using function values and optionally first derivatives (comprehensive) |
| E04WDF
| Solves the nonlinear programming (NP) problem |
| H02CBF
| Integer QP problem (dense) |
| H02CEF
| Integer LP or QP problem (sparse), using E04NKF |