{"payload":{"pageCount":2,"repositories":[{"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":0,"issueCount":4,"starsCount":65,"forksCount":30,"license":null,"participation":[0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,1,9,6,13,4,7,1,1,0,0,0,1,0,0,0,0,0,3,0,0,1,0,1,0,0,1,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-20T08:53:28.484Z"}},{"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":0,"issueCount":3,"starsCount":14,"forksCount":10,"license":null,"participation":[1,0,0,0,1,0,1,1,0,1,1,0,0,0,0,0,0,0,4,3,11,0,4,3,0,0,1,0,0,0,0,0,0,1,0,1,0,0,3,1,1,2,4,5,11,2,0,0,0,3,1,1],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-20T08:48:46.227Z"}},{"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":3,"starsCount":106,"forksCount":15,"license":"MIT License","participation":[1,6,1,0,5,1,0,0,0,0,0,0,0,0,0,0,0,2,2,2,0,0,0,3,0,0,0,0,0,1,0,0,0,1,0,0,0,0,5,2,0,0,0,0,1,0,0,1,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-20T07:47:36.136Z"}},{"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":8,"starsCount":2214,"forksCount":393,"license":"Other","participation":[7,1,5,2,3,4,7,4,3,8,10,21,7,4,1,5,2,1,5,4,6,1,5,4,7,1,3,5,3,6,1,3,1,4,4,5,3,3,2,3,0,0,2,0,3,4,3,1,3,5,4,5],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-20T03:57:21.864Z"}},{"type":"Public","name":"open-energy-modeling-benchmarks","owner":"jump-dev","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":8,"starsCount":12,"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,0,0,0,0,0,0,0,0,0,0,0,1,3,2],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-20T00:11:48.775Z"}},{"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":18,"license":"MIT License","participation":[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,2,0,0,0,0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-19T20:37:55.633Z"}},{"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":[1,0,0,0,0,2,0,0,0,1,2,0,0,7,1,1,1,1,1,1,1,5,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,5,1,1,1,1,3,1,1,1,1,1,1,1,1,1],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-16T02:32:47.032Z"}},{"type":"Public","name":"PiecewiseLinearOpt.jl","owner":"jump-dev","isFork":false,"description":"Solve optimization problems containing piecewise linear functions","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":2,"issueCount":7,"starsCount":52,"forksCount":22,"license":"Other","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,0,0,0,0,0,0,0,0,0,0,0,0,6,1],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-13T00:10:07.043Z"}},{"type":"Public","name":"NLopt.jl","owner":"jump-dev","isFork":false,"description":"A Julia interface to the NLopt nonlinear-optimization library","allTopics":["math","optimization","julia","numerical-optimization","nonlinear-optimization","nonlinear-programming"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":1,"starsCount":262,"forksCount":46,"license":"Other","participation":[0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,25,0,0,2,1],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-13T00:07:46.489Z"}},{"type":"Public","name":"SDPLR.jl","owner":"jump-dev","isFork":false,"description":"Julia wrapper for SDPLR","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":1,"issueCount":0,"starsCount":7,"forksCount":1,"license":"Other","participation":[0,0,0,0,0,0,0,3,2,1,0,4,4,0,2,3,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,1,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-12T20:02:22.583Z"}},{"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":566,"forksCount":121,"license":"Other","participation":[0,0,0,0,0,0,0,0,1,1,1,0,0,0,8,17,20,9,2,0,0,0,0,0,0,0,0,1,2,6,5,4,24,18,15,3,1,1,2,2,0,0,0,0,0,0,0,0,0,0,2,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-09T22:44:06.477Z"}},{"type":"Public","name":"MathOptInterface.jl","owner":"jump-dev","isFork":false,"description":"A data structure for mathematical optimization problems","allTopics":["optimization","julia","mathematical-programming","jump-jl"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":2,"issueCount":17,"starsCount":392,"forksCount":87,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-09T21:41:09.136Z"}},{"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":2,"starsCount":17,"forksCount":4,"license":"MIT License","participation":[5,0,1,0,1,0,2,0,2,0,0,0,0,0,0,0,0,0,2,4,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,0,1,0,0,1,0,4,1,0,0,0,0,0,3,2,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-07T02:06:25.887Z"}},{"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":2,"issueCount":14,"starsCount":49,"forksCount":8,"license":"Mozilla Public License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-03T00:30:42.040Z"}},{"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":77,"forksCount":23,"license":"Other","participation":[0,0,0,0,0,0,2,11,0,10,3,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,3,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,1,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-08-29T22:03:22.089Z"}},{"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":14,"issueCount":35,"starsCount":115,"forksCount":24,"license":"Other","participation":[4,0,0,0,0,1,0,0,0,0,9,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,5,5,0,0,0,0,1,0,2,9,0,0,0,0,0,1,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-08-29T20:57:08.804Z"}},{"type":"Public","name":"NEOSServer.jl","owner":"jump-dev","isFork":false,"description":"A Julia interface for the NEOS Optimisation Server","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":30,"forksCount":8,"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,0,0,0,0,0,0,0,0,0,6,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-08-23T03:28:30.362Z"}},{"type":"Public","name":"Pavito.jl","owner":"jump-dev","isFork":false,"description":"A gradient-based outer approximation solver for convex mixed-integer nonlinear programming (MINLP)","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":6,"starsCount":60,"forksCount":10,"license":"Other","participation":[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,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,2,0,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-08-12T05:00:41.492Z"}},{"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":152,"forksCount":58,"license":"Other","participation":[1,0,4,0,2,0,1,0,1,0,1,0,0,0,1,4,0,0,2,0,0,0,2,0,0,0,0,0,0,1,0,0,0,1,0,0,3,2,0,0,0,0,1,2,3,2,0,0,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-08-08T05:33:27.400Z"}},{"type":"Public","name":"ParametricOptInterface.jl","owner":"jump-dev","isFork":false,"description":"Extension for dealing with parameters","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":1,"issueCount":3,"starsCount":36,"forksCount":7,"license":"MIT License","participation":[0,0,5,0,9,0,0,0,0,8,6,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,4,2,0,0,2,0,2,0,0,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-08-06T18:29:19.483Z"}},{"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":1,"issueCount":0,"starsCount":4,"forksCount":1,"license":"Other","participation":[0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-07-30T08:31:28.219Z"}},{"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":219,"forksCount":80,"license":"MIT License","participation":[0,0,1,1,3,5,0,0,1,0,2,0,3,0,0,0,0,0,0,0,1,0,0,1,2,0,2,0,0,1,0,0,0,2,2,0,0,0,2,0,0,0,0,0,1,0,0,0,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-07-29T05:08:00.518Z"}},{"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":54,"forksCount":25,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-07-25T23:54:19.820Z"}},{"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":13,"starsCount":122,"forksCount":14,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-07-23T17:27:04.762Z"}},{"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-07-17T05:00:47.815Z"}},{"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":101,"forksCount":37,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-07-17T01:57:22.973Z"}},{"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":41,"forksCount":17,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-07-17T01:44:38.153Z"}},{"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":2,"starsCount":81,"forksCount":27,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-07-17T01:30:01.445Z"}},{"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":6,"issueCount":18,"starsCount":140,"forksCount":15,"license":"Other","participation":[0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,3,0,0,2,0,0,0,0,0,0,0,1,0,0,1,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-07-10T12:20:42.694Z"}},{"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":8,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-07-04T08:56:52.992Z"}}],"repositoryCount":58,"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":"jump-dev repositories"}