Find your next solver

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

An Open-Source java library for constraint programming

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

Achieve world-record speed on large-scale problems with millions of constraints and variables—saving time and reducing costs.

A game to better understand how CVRP works.

CVXPY is an open source Python-embedded modeling language for convex optimization problems. It lets you express your problem in a natural way that follows the math, rather than in the restrictive standard form required by solvers.

The CVXPY Discord community is a group of people who use the CVXPY software to solve convex optimization problems in Python

Gecode is an open source C++ toolkit for developing constraint-based systems and applications. Gecode provides a constraint solver with state-of-the-art performance while being modular and extensible.

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

An innovative constraints programming component able to solve quickly and efficiently a wide range of combinatorial problems relying on an interactive and user-friendly hybrid framework including constraint programming, mixed-integer programming and artificial intelligence.

The most advanced solver for nonlinear optimization.

Teaching and writing about all things AI, operations, and his startup experience.

MiniZinc is a high-level constraint modelling language that allows you to easily express and solve discrete optimisation problems.

Thought leadership from the MIT Center for Transportation & Logistics.

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.

Customer success stories from ORTEC

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

President of Optisol, Scheduling Specialist for High-Variety, Order-Driven Production and Resource-Constrained Projects.

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.

Updated fork from OptaPlanner