| E04MFF | LP problem (dense) |
| E04NCF | Convex QP problem or linearly-constrained linear least-squares problem (dense) |
| E04NFF | QP problem (dense) |
| E04NKF | LP or QP problem (sparse) |
| E04UCF | Minimum, function of several variables, sequential QP method, nonlinear constraints, using function values and optionally first derivatives (forward communication, comprehensive) |
| E04UFF | Minimum, function of several variables, sequential QP method, nonlinear constraints, using function values and optionally first derivatives (reverse communication, comprehensive) |
| E04UGF | NLP problem (sparse) |
| E04USF | Minimum of a sum of squares, nonlinear constraints, sequential QP method, using function values and optionally first derivatives (comprehensive) |
| H02CBF | Integer QP problem (dense) |
| H02CEF | Integer LP or QP problem (sparse) |