The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
JuMP: A Modeling Language for Mathematical Optimization
Open accessAbstract
JuMP is an open-source modeling language that allows users to express a wide range of optimization problems (linear, mixed-integer, quadratic, conic-quadratic, semidefinite, and nonlinear) in a high-level, algebraic syntax. JuMP takes advantage of advanced features of the Julia programming language to offer unique functionality while achieving performance on par with commercial modeling tools for standard tasks. In this work we will provide benchmarks, present the novel aspects of the implementation, and discuss how JuMP can be extended to new problem classes and composed with state-of-the-art tools for visualization and interactivity.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Wächter, A., & Biegler, L. T. (2006) · Mathematical Programming · doi:10.1007/s10107-004-0559-y · Cited by 9,483
Julia: A Fresh Approach to Numerical Computing
Bezanson, J., Edelman, A., Karpinski, S., & Shah, V. B. (2017) · SIAM Review · doi:10.1137/141000671 · Cited by 5,440
Theory and Applications of Robust Optimization
Brown, D. B., Caramanis, C., & Bertsimas, D. (2010) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 2,524
Applications of second-order cone programming
Lobo, M. S., Vandenberghe, L., Boyd, S., & Lebret, H. (1998) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(98)10032-0 · Cited by 2,401
Strategic facility location: A review
Owen, S. H., & Daskin, M. S. (1998) · European Journal of Operational Research · doi:10.1016/s0377-2217(98)00186-6 · Cited by 1,380
Pyomo: modeling and solving mathematical programs in Python
Hart, W. E., Watson, J.-P., & Woodruff, D. L. (2011) · Mathematical Programming Computation · doi:10.1007/s12532-011-0026-8 · Cited by 1,201
A Modeling Language for Mathematical Programming
Fourer, R., Gay, D. M., & Kernighan, B. W. (1990) · Management Science · doi:10.1287/mnsc.36.5.519 · Cited by 660
Alnæs, M. S., Logg, A., Ølgaard, K. B., Rognes, M. E., & Wells, G. N. (2014) · ACM Transactions on Mathematical Software · doi:10.1145/2566630 · Cited by 615
Chance-Constrained Optimal Power Flow: Risk-Aware Network Control under Uncertainty
Bienstock, D., Chertkov, M., & Harnett, S. (2014) · SIAM Review · doi:10.1137/130910312 · Cited by 496
Computing in Operations Research Using Julia
Lubin, M., & Dunning, I. (2015) · INFORMS journal on computing · doi:10.1287/ijoc.2014.0623 · Cited by 367
Self-citationAdifor 2.0: automatic differentiation of Fortran 77 programs
Bischof, C., Khademi, P., Mauer, A., & Carle, A. (1996) · IEEE Computational Science and Engineering · doi:10.1109/99.537089 · Cited by 366
Introduction to Automatic Differentiation and MATLAB Object-Oriented Programming
Neidinger, R. D. (2010) · SIAM Review · doi:10.1137/080743627 · Cited by 271
Notable design patterns for domain-specific languages
Spinellis, D. D. (2001) · Journal of Systems and Software · doi:10.1016/s0164-1212(00)00089-3 · Cited by 239
Automatic robust convex programming
Löfberg, J. (2012) · Optimization Methods and Software · doi:10.1080/10556788.2010.517532 · Cited by 227
Interactive notebooks: Sharing the code
Shen, H. (2014) · Nature · doi:10.1038/515151a · Cited by 224
A Method of Reaching Extreme Altitudes
Goddard, R. (1920) · Nature · doi:10.1038/105809a0 · Cited by 133
PySP: modeling and solving stochastic programs in Python
Watson, J., Woodruff, D. L., & Hart, W. E. (2012) · Mathematical Programming Computation · doi:10.1007/s12532-012-0036-1 · Cited by 124
Robust Optimization Made Easy with ROME
Goh, J., & Sim, M. (2011) · Operations Research · doi:10.1287/opre.1110.0944 · Cited by 105
Robust Optimization of EV Charging Schedules in Unregulated Electricity Markets
Korolko, N., & Şahinoğlu, Z. (2015) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2015.2472597 · Cited by 97
Polylithic modeling and solution approaches using algebraic modeling systems
Kallrath, J. (2011) · Optimization Letters · doi:10.1007/s11590-011-0320-4 · Cited by 36
Cited by
OSQP: an operator splitting solver for quadratic programs
Stellato, B., Banjac, G., Goulart, P., Bemporad, A., & Boyd, S. (2020) · Mathematical Programming Computation · doi:10.1007/s12532-020-00179-2 · Cited by 1,213
All you need to know about model predictive control for buildings
Drgoňa, J., Arroyo, J., Cupeiro Figueroa, I., Blum, D., Arendt, K., Kim, D., Ollé, E. P., Oravec, J., Wetter, M., Vrabie, D. L., et al. (2020) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2020.09.001 · Cited by 1,020
Smart “Predict, then Optimize”
Elmachtoub, A. N., & Grigas, P. (2022) · Management Science · doi:10.1287/mnsc.2020.3922 · Cited by 773
A rewriting system for convex optimization problems
Agrawal, A., Verschueren, R., Diamond, S., & Boyd, S. (2018) · Journal of Control and Decision · doi:10.1080/23307706.2017.1397554 · Cited by 669
Frameworks and Results in Distributionally Robust Optimization
Rahimian, H., & Mehrotra, S. (2022) · Open Journal of Mathematical Optimization · doi:10.5802/ojmo.15 · Cited by 506
Metadata
- Authors
- Dunning, I., Huchette, J., & Lubin, M.
- Venue
- SIAM Review
- Published
- 2017-01
- Volume
- 59
- Issue
- 2
- Pages
- 295-320
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W1918816242
- Cited by
- 1,250
- References
- 20
- FWCI
- 84.26
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.