MultiJuMP swMATH ID: 20366 Software Authors: A. N. Riseth Description: MultiJuMP enables the user to easily run multiobjective optimisation problems and generate Pareto fronts. MultiJuMP enables the user to easily run multiobjective optimisation problems and generate Pareto fronts. The code is built as an extension of https://github.com/JuliaOpt/JuMP.jl. We have implemented three ways to trace out the Pareto front: Normal Boundary Intersection (solve(m, method = :NBI)); Weighted sums (solve(m, method = :WS)); Constraint methods (solve(m, method = :EPS)); This method only works for biobjective optimisation as of now. Homepage: https://github.com/anriseth/MultiJuMP.jl Source Code: https://github.com/anriseth/MultiJuMP.jl Dependencies: JuMP Related Software: extended-MIQCP; Jupyter; GPkit; VariationalInequality; Complementarity; Gadfly; Interact.jl; SolverStudio; JuMP; ForwardDiff; Julia; GUSS; UFL; Stan; COPS; ColPack; CasADi; GSL; GAMS; PySP Cited in: 1 Publication Cited by 3 Authors 1 Dunning, Iain 1 Huchette, Joey 1 Lubin, Miles Cited in 1 Serial 1 SIAM Review Cited in 2 Fields 1 Numerical analysis (65-XX) 1 Operations research, mathematical programming (90-XX) Citations by Year