# JuMP — Julia for Mathematical Optimization¶

Warning

This documentation tracks the development branch of JuMP. For the documentation of the latest JuMP release, see here.

JuMP is a domain-specific modeling language for
mathematical optimization
embedded in Julia.
It currently supports a number of open-source and commercial solvers (see below)
for a variety of problem classes, including **linear programming**, **mixed-integer programming**, **second-order conic programming**, **semidefinite programming**, and **nonlinear programming**.
JuMP’s features include:

- User friendliness
- Syntax that mimics natural mathematical expressions.
- Complete documentation.

- Speed
- Benchmarking has shown that JuMP can create problems at similar speeds to special-purpose modeling languages such as AMPL.
- JuMP communicates with solvers in memory, avoiding the need to write intermediary files.

- Solver independence
- JuMP uses a generic solver-independent interface provided by the MathProgBase package, making it easy to change between a number of open-source and commercial optimization software packages (“solvers”).
- Currently supported solvers include Artelys Knitro, Bonmin, Cbc, Clp, Couenne, CPLEX, ECOS, FICO Xpress, GLPK, Gurobi, Ipopt, MOSEK, NLopt, and SCS.

- Access to advanced algorithmic techniques
- Including efficient LP re-solves and callbacks for mixed-integer programming which previously required using solver-specific and/or low-level C++ libraries.

- Ease of embedding
- JuMP itself is written purely in Julia. Solvers are the only binary dependencies.
- Being embedded in a general-purpose programming language makes it easy to solve optimization problems as part of a larger workflow (e.g., inside a simulation, behind a web server, or as a subproblem in a decomposition algorithm).
- As a trade-off, JuMP’s syntax is constrained by the syntax available in Julia.

- JuMP is MPL licensed, meaning that it can be embedded in commercial software that complies with the terms of the license.

While neither Julia nor JuMP have reached version 1.0 yet, the releases are stable enough for everyday use and are being used in a number of research projects and neat applications by a growing community of users who are early adopters. JuMP remains under active development, and we welcome your feedback, suggestions, and bug reports.

## Installing JuMP¶

If you are familiar with Julia you can get started quickly by using the package manager to install JuMP:

```
julia> Pkg.add("JuMP")
```

And a solver, e.g.:

```
julia> Pkg.add("Clp") # Will install Cbc as well
```

Then read the Quick Start Guide and/or see a Simple Example. The subsequent sections detail the complete functionality of JuMP.

## Contents¶

### Citing JuMP¶

If you find JuMP useful in your work, we kindly request that you cite the following paper:

```
@article{DunningHuchetteLubin2015,
title = {{JuMP}: {A} modeling language for mathematical optimization},
author = {Iain Dunning and Joey Huchette and Miles Lubin},
journal = {arXiv:1508.01982 [math.OC]},
year = {2015},
url = {http://arxiv.org/abs/1508.01982}
}
```

For an earlier work where we presented a prototype implementation of JuMP, see here:

```
@article{LubinDunningIJOC,
author = {Miles Lubin and Iain Dunning},
title = {Computing in Operations Research Using Julia},
journal = {INFORMS Journal on Computing},
volume = {27},
number = {2},
pages = {238-248},
year = {2015},
doi = {10.1287/ijoc.2014.0623},
URL = {http://dx.doi.org/10.1287/ijoc.2014.0623}
}
```

A preprint of this paper is freely available on arXiv.