Here we explain how the products differ, and the circumstances in which they might be used. This is a comprehensive archive of online information on global optimization, and somewhat less comprehensive on local optimization, collected by Arnold Neumaier. Oh, and we also want to solve it as an integer program. I wrote an optimization code.
Most codes are in public domain and can be retrieved via anonymous ftp.
The collection concentrates on codes in network optimization, graph theory and other combinatorial optimization problems, and has a bias towards Unix platforms. The MDO Test Suite comprises a set of problems to be used in developing optimization methodologies for MDO problems. The problems are divided into classes by complexity. Ideally, complete source codes for a conventional solution, for MDO benchmark solutions and for analytic derivatives are provided as well. The algorithms proceed either from an analytic specification of the Jacobian matrix or directly from the problem functions.