Find your next solver

Advanced Analytics in Practice focusing on breaking down what it takes to build real-world advanced analytics applications.

Course about advanced modeling for discrete optimization, covering topics such as debugging or predicates

AGI? No, thank you! Learning and Intelligent Optimization? Yes, please! https://intelligent-optimization.org/

Learn more about how AI is changing businesses and how you can leverage it: Insights, tools, tips, and expert voices

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

Course about basic modeling for discrete optimization with MiniZinc

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.

A mathematical optimization solver for large-scale optimization problems. It is independently developed by Cardinal Operations, and it includes high-performance solvers for LP, MIP, SDP, (MI)SOCP, convex (MI)QP, convex (MI)QCP and exponential cone programming.

The IBM ILOG CPLEX Optimizer solves integer programming problems, very large[3] linear programming problems using either primal or dual variants of the simplex method or the barrier interior point method, convex and non-convex quadratic programming problems, and convex quadratically constrained problems (solved via second-order cone programming, or SOCP).

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

Course about discrete optimization covering a wide range of optimization techniques such as Constraint Programming, Local Search or Column Generation

Where Operations Research practitioners share real-world strategies and emerging techniques for optimal decision-making.

The FICO Xpress optimizer is a commercial optimization solver for linear programming (LP), mixed integer linear programming (MILP), convex quadratic programming (QP), convex quadratically constrained quadratic programming (QCQP), second-order cone programming (SOCP) and their mixed integer counterparts. Xpress includes a general purpose non-linear solver, Xpress NonLinear, including a successive linear programming algorithm (SLP, first-order method), and Artelys Knitro (second-order methods).

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.

For solving large-scale linear programming (LP), mixed integer programming (MIP), and other related problems. It is a set of routines written in ANSI C and organized in the form of a callable library.

Gurobi Optimizer is a prescriptive analytics platform and a decision-making technology developed by Gurobi Optimization, LLC. The Gurobi Optimizer (often referred to as simply, “Gurobi”) is a solver, since it uses mathematical optimization to calculate the answer to a problem.

A gentle introduction to optimization with Python.

Heuristic-based solver with great results in complex problems

HiGHS is open-source software to solve linear programming (LP), mixed-integer programming (MIP), and convex quadratic programming (QP) models.

Analytics, Data Science, and AI - Actionable insights and thoughts to drive positive business transformation and impact.

Optimization software that leverages machine learning to provide unparalleled performance.

One puzzle every week.

An introduction to Operations Research with theory from Linear Programming to simulation, passing through Nonlinear Programming, Game Theory, Metaheuristics or Network flows, among others.

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

jMetal is a Java-based framework for multi-objective optimization with metaheuristics.

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.

LINGO includes a set of built-in solvers to tackle a wide variety of problems. Unlike many modeling packages, all of the LINGO solvers are directly linked to the modeling environment.

A Mixed Integer Linear Programming (MILP) solver.

Practical AI for business, my experience starting and selling a company, and other content.

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

A gradient-free optimization platform.

Roundup of Operations Research, Decision Science, and DecisionOps content from Nextmv and the optimization community

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.

A book covering the basics of Operations Research

Business Intelligence using optimal decision making tools.

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

Planning education for real-world stuff, the newsletter for problem solvers at scale.

🌟 Welcome to the Prescriptive Analytics and Decision Optimization (PRADO) Series 2025! 🌟 The series of presentations about OR in practice, tools, and technologies. 📅 Program Sneak Peek: 🎤 March: Optimizing pharmacy procurement with substitution of drugs

Laura Albert’s newsletter about OR.

Course about all things mathematical optimization: unconstrained, LP, NLP, MIP, Global optimization, Dynamic optimization, ML for optimization, and optimization under uncertainty.

SCIP is currently one of the fastest non-commercial solvers for mixed integer programming (MIP) and mixed integer nonlinear programming (MINLP). It is also a framework for constraint integer programming and branch-cut-and-price.

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.

Course about solving discrete optimization problems with different techniques: Constraint Programming, Mixed Integer Programming and Local Search

Advice from a decision strategist with 19 years expertise in analytics & AI, inc. Gartner, system integrators & industry

Updated fork from OptaPlanner