Find your next solver

The journal publishes 24 issues a year that focus on the theoretical, practical, and computational aspects of operations research

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

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.

Operations research and computers interact in many scientific fields of vital importance to our society. These include, among others, transportation, economics, investment strategy, inventory control, logistics, safety, reliability, urban planning, and ecology. Computers & Operations Research (COR) provides an international forum for the application of computers and operations research techniques to problems in these and related fields.

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

It is a peer-reviewed academic journal in operations research. It was founded in 1977 by the Association of European Operational Research Societies

Heuristic-based solver with great results in complex problems

It is a peer-reviewed academic journal which is published six times a year by Wiley-Blackwell on behalf of the International Federation of Operational Research Societies. The editorial mission of the journal is to advance the theory and practice of Operational Research and Management Science internationally

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.

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.

It is a quarterly peer-reviewed scientific journal established in February 1976. It focuses on areas of mathematics relevant to the field of operations research such as continuous optimization, discrete optimization, game theory, machine learning, simulation methodology, and stochastic models. The journal is published by INFORMS (Institute for Operations Research and the Management Sciences)

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.

Journal about Operations Research from INFORMS

It is a bimonthly peer-reviewed academic journal covering operations research. It was established in 1981

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.

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.

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.