{"payload":{"pageCount":2,"repositories":[{"type":"Public","name":"Ipopt.jl","owner":"jump-dev","isFork":false,"description":"A Julia interface to the Ipopt nonlinear solver","allTopics":["julia","nonlinear-programming","jump-jl"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":147,"forksCount":58,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-09T00:09:41.171Z"}},{"type":"Public","name":"MutableArithmetics.jl","owner":"jump-dev","isFork":false,"description":"Interface for arithmetics on mutable types in Julia","allTopics":[],"primaryLanguage":{"name":"TeX","color":"#3D6117"},"pullRequestCount":3,"issueCount":13,"starsCount":49,"forksCount":8,"license":"Mozilla Public License 2.0","participation":[0,0,0,0,0,0,0,0,0,0,2,1,2,0,2,0,0,1,0,0,0,0,0,0,10,0,0,1,1,0,1,0,0,0,0,6,0,1,2,0,0,3,0,2,6,6,0,0,0,0,1,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-08T08:25:01.862Z"}},{"type":"Public","name":"SumOfSquares.jl","owner":"jump-dev","isFork":false,"description":"Sum of Squares Programming for Julia","allTopics":["optimization","polynomials","julia"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":12,"issueCount":30,"starsCount":114,"forksCount":24,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-08T08:24:08.367Z"}},{"type":"Public","name":"Convex.jl","owner":"jump-dev","isFork":false,"description":"A Julia package for disciplined convex programming","allTopics":["convex-optimization","julia","solver"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":1,"issueCount":8,"starsCount":551,"forksCount":119,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-08T00:10:51.111Z"}},{"type":"Public","name":"JuMP.jl","owner":"jump-dev","isFork":false,"description":"Modeling language for Mathematical Optimization (linear, mixed-integer, conic, semidefinite, nonlinear)","allTopics":["optimization","julia","linear-programming","modeling-language","mathematical-modelling","semidefinite-programming","nonlinear-programming","mixed-integer-programming","conic-programs","mathematical-programming"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":2,"issueCount":10,"starsCount":2158,"forksCount":390,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-05T22:30:16.721Z"}},{"type":"Public","name":"PolyJuMP.jl","owner":"jump-dev","isFork":false,"description":"A JuMP extension for Polynomial Optimization","allTopics":["optimization","julia","polynomials"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":2,"issueCount":5,"starsCount":41,"forksCount":7,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-04T13:56:45.873Z"}},{"type":"Public","name":"Gurobi_jll.jl","owner":"jump-dev","isFork":false,"description":"A Julia package for installing the Gurobi Optimizer","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":1,"issueCount":0,"starsCount":0,"forksCount":1,"license":"MIT License","participation":[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,2,0,0,0,0,0,4,2,0,3,1,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-04T01:23:04.367Z"}},{"type":"Public","name":"benchmarks","owner":"jump-dev","isFork":false,"description":"A repository for long-term benchmarking of JuMP performance","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":2,"starsCount":19,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-03T02:09:43.227Z"}},{"type":"Public","name":"DiffOpt.jl","owner":"jump-dev","isFork":false,"description":"Differentiating convex optimization programs w.r.t. program parameters","allTopics":["mathematical-modelling","differentiable-programming","optimization","julia"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":2,"issueCount":12,"starsCount":120,"forksCount":12,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-31T10:05:54.116Z"}},{"type":"Public","name":"MathOptInterface.jl","owner":"jump-dev","isFork":false,"description":"An abstraction layer for mathematical optimization solvers","allTopics":["optimization","julia","mathematical-programming","jump-jl"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":4,"issueCount":16,"starsCount":371,"forksCount":86,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-31T03:05:41.822Z"}},{"type":"Public","name":"Xpress_jll.jl","owner":"jump-dev","isFork":false,"description":"A Julia package for installing the FICO Xpress Optimization suite","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":1,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-29T21:05:29.632Z"}},{"type":"Public","name":"MiniZinc.jl","owner":"jump-dev","isFork":false,"description":"A Julia interface to the MiniZinc constraint modeling language","allTopics":["julia","constraint-programming","minizinc","jump-jl"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":1,"issueCount":1,"starsCount":15,"forksCount":3,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-25T04:07:17.298Z"}},{"type":"Public","name":"jump-dev.github.io","owner":"jump-dev","isFork":false,"description":"Source for jump.dev","allTopics":[],"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":1,"issueCount":3,"starsCount":11,"forksCount":10,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-24T23:58:45.438Z"}},{"type":"Public","name":"BARON.jl","owner":"jump-dev","isFork":false,"description":"A Julia interface to the BARON mixed-integer nonlinear programming solver","allTopics":["julia","nonlinear-programming","mixed-integer-programming","jump-jl"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":1,"starsCount":18,"forksCount":12,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-23T23:32:48.140Z"}},{"type":"Public","name":"Gurobi.jl","owner":"jump-dev","isFork":false,"description":"A Julia interface to the Gurobi Optimizer","allTopics":["julia","linear-programming","quadratic-programming","mixed-integer-programming","second-order-cone-programming","jump-jl"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":213,"forksCount":79,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-22T22:29:54.881Z"}},{"type":"Public","name":"MultiObjectiveAlgorithms.jl","owner":"jump-dev","isFork":false,"description":"A Julia package for solving multi-objective optimization problems","allTopics":["algorithm","optimization","julia","multi-objective-optimization","jump-jl"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":59,"forksCount":5,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-16T22:06:05.016Z"}},{"type":"Public","name":"GLPK.jl","owner":"jump-dev","isFork":false,"description":"A Julia interface to the GNU Linear Programming Kit","allTopics":["julia","linear-programming","jump-jl"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":103,"forksCount":37,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-16T00:32:27.671Z"}},{"type":"Public","name":"DSDP.jl","owner":"jump-dev","isFork":false,"description":"A Julia interface to the DSDP semidefinite programming solver","allTopics":["julia","semidefinite-programming","jump-jl"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":4,"forksCount":1,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-15T23:51:45.441Z"}},{"type":"Public","name":"Hypatia.jl","owner":"jump-dev","isFork":false,"description":"interior point solver for general convex conic optimization problems","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":4,"issueCount":18,"starsCount":134,"forksCount":15,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-14T23:56:44.700Z"}},{"type":"Public","name":"Xpress.jl","owner":"jump-dev","isFork":false,"description":"A Julia interface to the FICO Xpress Optimization suite","allTopics":["julia","linear-programming","nonlinear-programming","mixed-integer-programming","jump-jl"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":1,"issueCount":3,"starsCount":63,"forksCount":30,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-13T04:15:02.774Z"}},{"type":"Public","name":"SCS.jl","owner":"jump-dev","isFork":false,"description":"A Julia interface for the SCS conic programming solver","allTopics":["julia","conic-optimization","jump-jl"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":1,"starsCount":82,"forksCount":27,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-13T03:22:28.769Z"}},{"type":"Public","name":"Clp.jl","owner":"jump-dev","isFork":false,"description":"A Julia interface to the Coin-OR Linear Programming solver (CLP)","allTopics":["julia","linear-programming","jump-jl"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":1,"starsCount":52,"forksCount":26,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-13T03:19:09.470Z"}},{"type":"Public","name":"Cbc.jl","owner":"jump-dev","isFork":false,"description":"A Julia interface to the Coin-OR Branch and Cut solver (CBC)","allTopics":["julia","mixed-integer-programming","jump-jl"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":4,"starsCount":81,"forksCount":35,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-13T03:08:18.036Z"}},{"type":"Public","name":"HiGHS.jl","owner":"jump-dev","isFork":false,"description":"A Julia interface to the HiGHS solver","allTopics":["optimization","julia","simplex","linear-programming","dual-simplex","jump-jl"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":2,"starsCount":95,"forksCount":13,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-13T03:07:38.835Z"}},{"type":"Public","name":"CPLEX.jl","owner":"jump-dev","isFork":false,"description":"A Julia interface to the CPLEX solver","allTopics":["julia","linear-programming","quadratic-programming","mixed-integer-programming","jump-jl"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":1,"starsCount":131,"forksCount":63,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-13T02:52:37.743Z"}},{"type":"Public","name":"AmplNLWriter.jl","owner":"jump-dev","isFork":false,"description":"A Julia interface to AMPL-enabled solvers","allTopics":["julia","nonlinear-programming","jump-jl"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":65,"forksCount":20,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-13T02:46:59.633Z"}},{"type":"Public","name":"MosekTools.jl","owner":"jump-dev","isFork":false,"description":"A MathOptInterface.jl interface to the MOSEK solver","allTopics":["julia","jump","conic-optimization"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":3,"issueCount":10,"starsCount":29,"forksCount":8,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-07T22:43:00.854Z"}},{"type":"Public","name":"ECOS.jl","owner":"jump-dev","isFork":false,"description":"A Julia interface to the ECOS conic optimization solver","allTopics":["julia","conic-optimization","jump-jl"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":1,"starsCount":40,"forksCount":17,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-04-18T09:25:09.200Z"}},{"type":"Public","name":"KNITRO.jl","owner":"jump-dev","isFork":false,"description":"A Julia interface to the Artelys Knitro solver","allTopics":["julia","nonlinear-programming","mixed-integer-programming","jump-jl"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":1,"issueCount":2,"starsCount":75,"forksCount":23,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-04-18T08:54:16.050Z"}},{"type":"Public","name":"SDPA.jl","owner":"jump-dev","isFork":false,"description":"A Julia interface to the SDPA semidefinite programming solver","allTopics":["julia","semidefinite-programming","jump-jl"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":1,"starsCount":11,"forksCount":4,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-03-08T01:24:02.128Z"}}],"repositoryCount":54,"userInfo":null,"searchable":true,"definitions":[],"typeFilters":[{"id":"all","text":"All"},{"id":"public","text":"Public"},{"id":"source","text":"Sources"},{"id":"fork","text":"Forks"},{"id":"archived","text":"Archived"},{"id":"template","text":"Templates"}],"compactMode":false},"title":"Repositories"}