E04MFF/E04MFA | LP problem (dense) |

E04NCF/E04NCA | Convex QP problem or linearly-constrained linear least squares problem (dense) |

E04NFF/E04NFA | QP problem (dense) |

E04NKF/E04NKA | LP or QP problem (sparse) |

E04NQF | LP or QP problem (suitable for sparse problems) |

E04UCF/E04UCA | Minimum, function of several variables, sequential QP method, nonlinear constraints, using function values and optionally first derivatives (comprehensive) |

E04UFF/E04UFA | Minimum, function of several variables, sequential QP method, nonlinear constraints, using function values and optionally first derivatives (reverse communication, comprehensive) |

E04UGF/E04UGA | NLP problem (sparse) |

E04USF/E04USA | Minimum of a sum of squares, nonlinear constraints, sequential QP method, using function values and optionally first derivatives (comprehensive) |

E04VHF | General sparse nonlinear optimizer |

E04WDF | Solves the nonlinear programming (NP) problem |

H02CBF | Integer QP problem (dense) |

H02CEF | Integer LP or QP problem (sparse), using E04NKF |

© The Numerical Algorithms Group Ltd, Oxford UK. 2013