Find your next solver

BARON is the industry-leading solver for mixed-integer nonlinear programming (MINLP).

Web-based app that is intended to act as an entry point for data scientists and problem solvers who could benefit from optimization; the game teaches players why optimization is valuable and important, why it’s difficult (by showcasing the scaling and added complexity of optimization throughout round play), and why solvers and other optimization algorithms are essential in finding an optimal solution.

Ceres Solver is an open source C++ library for modeling and solving large, complicated optimization problems. It can be used to solve Non-linear Least Squares problems with bounds constraints and general unconstrained optimization problems.

http://clarabel.rs/ is a Rust implementation of an interior point numerical solver for convex optimization problems using a novel homogeneous embedding.

CONOPT is a feasible path solver based on advanced active set methods, particularly suited for large and sparse models.

Heuristic-based solver with great results in complex problems

Ipopt (Interior Point Optimizer, pronounced "Eye-Pea-Opt") is an open source software package for large-scale nonlinear optimization. It can be used to solve general nonlinear programming problems

The most advanced solver for nonlinear optimization.

Interactive resources to learn OR.

The TLC is a simple constrained integer program turned into a game that you can play in a classroom with Legos. In each round of the game, your team acts as a boutique woodworking company who must decide which items to build and sell to the market. The goal is to decide how many of each type of item to build to maximize profits and beat other teams, where you are constrained by how many component pieces you have available.

LGO is capable of determining high-quality solutions to global optimization problems that have (possibly many) locally optimal solutions. Because LGO makes only limited assumptions as to problem structure and differentiability, it can be applied in a broad range of design and operational applications.

LOQO is a powerful solver for smooth constrained optimization problems, based on interior-point method applied to a sequence of quadratic approximations. Subject to the requirement that the defining functions be smooth (at the points evaluated by the algorithm), LOQO can handle a range of problems: linear or nonlinear, convex or nonconvex, constrained or unconstrained. For convex problems, LOQO finds a globally optimal solution; otherwise, it iterates from the given starting point to find a locally optimal solution.

MINOS is an established choice for both linear and nonlinear optimization problems. It incorporates proven methods for large-scale sparse nonlinear constraints, and its methods are especially effective for nonlinear objectives subject to linear and near-linear constraints.

Solves your LPs, QPs, SOCPs, SDPs, and MIPs. Includes interfaces to C, C++, Java, MATLAB, .NET, Python, Julia, Rust and R.

NLopt is a free/open-source library for nonlinear optimization, providing a common interface for a number of different free optimization routines available online as well as original implementations of various other algorithms.

Developed to help spark an interest for mathematics in children and young adults. I use optimization concepts in the context of real-life problems as motivation. All you need are a printer to print the pages with the instructions and a pair of scissors to cut out the game pieces.

The OSQP (Operator Splitting Quadratic Program) solver is a numerical optimization package for solving convex quadratic programs.

The PATH solver for MCP models is a Newton-based solver that combines a number of the most effective variations, extensions, and enhancements of this powerful technique.

PATHNLP is a solver for large nonlinear programming problems that builds on the PATH algorithm, extending it from mixed complementarity problems to general NLPs. PATHNLP is distributed through the GAMS ecosystem.

Seems some of us can't see a problem without wanting to take a crack at solving it. Does that sound like you? Good. Forge ahead and ponder this month's problem. We'll post a new one every month, and allow a month for you to submit solutions (we may even publish submitted answers, especially if they're correct).

A comprehensive guide to mathematical modeling with more than 140 games as case studies.

SCS (Splitting Conic Solver) is a numerical optimization package for solving large-scale convex quadratic cone problems. The code is freely available on https://github.com/cvxgrp/scs. It solves primal-dual problems.

Deliver 100 barrels to the customer at the lowest cost. Select wells and refineries to choose volume flowing on pipe-lines.

A software package for solving large-scale optimization problems (linear and nonlinear programs). It employs a sparse SQP algorithm with limited-memory quasi-Newton approximations to the Hessian of Lagrangian. SNOPT is especially effective for nonlinear problems whose functions and gradients are expensive to evaluate.

A game to play the Knapsack to learn how to solve it.