JuMP 1.0: recent improvements to a modeling language for mathematical optimization
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Mathematical modeling or simulation for problems pertaining to operations research and mathematical programming (90-10)
This short software paper describes features and underlying design decisions leading to the release of Version 1.0 of the open-source algebraic modeling language JuMP. The motivation of JuMP is to provide a convenient way to model mathematical optimization problems of various kinds, including linear, integer, conic, semidefinite, and nonlinear programs, in the Julia programming language, and pass models to many different solvers through an efficient interface. In particular, the paper explains how JuMP 1.0 manages the sometimes competing requirements for generality, efficiency, and flexible access to solver-specific features. Code snippets display the syntax of JuMP on several small examples.
- SDDP.jl: A Julia Package for Stochastic Dual Dynamic Programming
- Julia: a fresh approach to numerical computing
- JuMP: a modeling language for mathematical optimization
- MathOptInterface: A Data Structure for Mathematical Optimization Problems
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Parallelizing the dual revised simplex method
- Pyomo -- optimization modeling in Python
- MathOptInterface: A Data Structure for Mathematical Optimization Problems
- One-shot learning for MIPs with SOS1 constraints
- On exact and inexact RLT and SDP-RLT relaxations of quadratic programs with box constraints
- Peak estimation of rational systems using convex optimization
- Diagnosing infeasible optimization problems using large language models
- Polynomial optimization: tightening RLT-based branch-and-bound schemes with conic constraints
- Achieving optimal locomotion using self-generated waves
- Column generation for multistage stochastic mixed-integer nonlinear programs with discrete state variables
- Sparse reconstruction of multi-dimensional kinetic distributions
- KLAP: KYP lemma based low-rank approximation for \(\mathcal{H}_2\)-optimal passivation
- Tighter yet more tractable relaxations and nontrivial instance generation for sparse standard quadratic optimization
- PySCIPOpt-ML: embedding trained machine learning models into mixed-integer programs
- Dynamic tariff-based demand response in retail electricity market under uncertainty
- Extreme values of the mass distribution associated with d-quasi-copulas via linear programming
- Discretization algorithms for generalized semi-infinite programs with coupling equality constraints under local solution stability
- Multistage stochastic optimization of a mono-site hydrogen infrastructure by decomposition techniques
- Energy matching in reduced passive and port-Hamiltonian systems
- Kazhdan constants for Chevalley groups over the integers
- Population-based iterated local search for batch scheduling on parallel machines with incompatible job families, release dates, and tardiness penalties
- Randomized quasi-Monte Carlo methods for risk-averse stochastic optimization
- An exact method and a heuristic for last-mile delivery drones routing with centralized graph-based airspace control
- Solving Euclidean max-sum problems exactly with cutting planes
- Streamlining emergency response: a K-adaptable model and a column-and-constraint-generation algorithm
- Capacity planning of renewable energy systems using stochastic dual dynamic programming
- A new upper bound for the growth factor in Gaussian elimination with complete pivoting
- Computing the worst-case due dates violations with budget uncertainty
- Uncertainty reduction in robust optimization
- Lissajous varieties
- Spanning and splitting: integer semidefinite programming for the quadratic minimum spanning tree problem
- A distributed market-clearing framework for highly interconnected electricity and gas systems
- An optimization-based algorithm for fair and calibrated synthetic data generation
- A relax-fix-and-exclude algorithm for an MINLP problem with multilinear interpolations
- Quadratic maximization of reachable values of stable discrete-time affine systems
- Modeling bidirectional flows in gas networks
- Thermodynamic ranking of pathways in reaction networks
- An ideal-sparse generalized moment problem reformulation for completely positive tensor decomposition exploiting maximal cliques of multi-hypergraphs
- Extending a continuous RLT-based algorithm to mixed-integer polynomial problems
- Tractable hierarchies of convex relaxations for polynomial optimization on the nonnegative orthant
- On the nonconvexity issue in the radial Calderón problem
- Edge expansion of a graph: SDP-based computational strategies
- Unifying view on sparse convex relaxations in polynomial optimization
- MDP modeling for multi-stage stochastic programs
- Optimization meets machine learning: an exact algorithm for semi-supervised support vector machines
- Quantified convergence of general homodyne measurements with applications to continuous variable quantum computing
- From heteroclinic loops to homoclinic snaking in reversible systems: rigorous forcing through computer-assisted proofs
This page was built for publication: JuMP 1.0: recent improvements to a modeling language for mathematical optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6095739)
