The NEOS Optimization Guide provides information pages for a number of optimization problem types. Select a topic of interest from the list below to be directed to the information page.

• Bound Constrained Optimization
• Combinatorial Optimization
• Complementarity Problems
• Constrained Optimization
• Continuous Optimization
• Derivative-Free Optimization
• Discrete Optimization
• Global Optimization
• Integer Linear Programming
• Linear Programming (LP)
• Mixed Integer Nonlinear Programming (MINLP)
• Mathematical Programs with Equilibrium Constraints (MPEC)
• Multi-Objective Optimization
• Nondifferentiable Optimization
• Nonlinear Programming
• Nonlinear Equations
• Nonlinear Least-Squares Problems
• Optimization Under Uncertainty
• Quadratically Constrained Quadratic Programming (QCQP)
• Quadratic Programming (QP)
• Semidefinite Programming (SDP)
• Semiinfinite Programming (SIP)
• Stochastic Linear Programming
• Second Order Cone Programming (SOCP)
• Stochastic Programming
• Traveling Salesman Problem (TSP)
• Unconstrained Optimization