|
Listed below are the available solvers organized by problem type. If you
need help in selecting a solver, consult the Optimization Tree of the NEOS Guide. The choice of
solver then determines the available input options for defining the optimization
problem.
Each solver has sample problems and background information on the solver.
Be sure to submit a sample problem to get a feel for how to submit
optimization problems to NEOS.
If you encounter problems, consult the
NEOS Server FAQ,
or contact us by clicking on the
Comments and Questions link at the bottom of the page.
Administration
Application
Bound Constrained Optimization
Combinatorial Optimization and Integer Programming
Complementarity Problems
Extended Mathematical Programming
Global Optimization
Linear Network Programming
Linear Programming
Mathematical Programs with Equilibrium Constraints
Mixed Integer Linear Programming
Mixed Integer Nonlinearly Constrained Optimization
Mixed-Integer Optimal Control Problems
Model Analyzers
Multi-Solvers
Nondifferentiable Optimization
Nonlinearly Constrained Optimization
Second Order Conic Programming
Semi-infinite Optimization
Semidefinite Programming
Stochastic Linear Programming
Unconstrained Optimization
|