# Discrete Optimization
**URL:** https://discourse.julialang.org/t/discrete-optimization/96731
**Category:** Optimization (Mathematical)
**Created:** [March 28, 2023, 11:58pm UTC](https://discourse.julialang.org/t/discrete-optimization/96731 "2023-03-28T23:58:49Z")
**Posts on this page:** 6
**Page:** 1
### Author:  [@Stuart\_Rogers](https://discourse.julialang.org/u/Stuart_Rogers)
#### Post date: [March 28, 2023, 11:58pm UTC](https://discourse.julialang.org/t/discrete-optimization/96731/1 "2023-03-28T23:58:49Z")
Is there a Julia optimization package that minimizes an objective function subject to constraints, where the unknowns are discrete (i.e., integer-valued), similar to MATLAB’s ga?
> **[Find minimum of function using genetic algorithm - MATLAB ga](https://www.mathworks.com/help/gads/ga.html)**
>
> This MATLAB function finds a local unconstrained minimum, x, to the objective function, fun.
---
### Author:  [@math\_opt](https://discourse.julialang.org/u/math_opt)
#### Post date: [March 29, 2023, 12:13am UTC](https://discourse.julialang.org/t/discrete-optimization/96731/2 "2023-03-29T00:13:28Z")
[JuMP](https://github.com/jump-dev/JuMP.jl) – provides you an interface to model optimization problems and call solvers like CPLEX, Gurobi, etc.
---
### Author:  [@stephenll](https://discourse.julialang.org/u/stephenll)
#### Post date: [March 29, 2023, 12:19am UTC](https://discourse.julialang.org/t/discrete-optimization/96731/3 "2023-03-29T00:19:35Z")
Evolutionary.jl may be able to do what you want. Check the test folder in GitHub for examples for integer problems.
---
### Author:  [@Stuart\_Rogers](https://discourse.julialang.org/u/Stuart_Rogers)
#### Post date: [March 29, 2023, 12:20am UTC](https://discourse.julialang.org/t/discrete-optimization/96731/4 "2023-03-29T00:20:31Z")
I am looking for a free solver. The number of unknown discrete variables is a few hundred or even a few thousand. I was looking for a metaheuristic, rather than branch-and-bound discrete solvers like HiGHS, SCIP, CPLEX, and Gurobi, which struggle for too many unknown discrete variables.
---
### Author:  [@odow](https://discourse.julialang.org/u/odow)
#### Post date: [March 29, 2023, 3:07am UTC](https://discourse.julialang.org/t/discrete-optimization/96731/5 "2023-03-29T03:07:35Z")
MIP solvers can support that number of variables but only if you objective function is linear or quadratic, which it sounds like it might not be.
---
### Author:  [@Stuart\_Rogers](https://discourse.julialang.org/u/Stuart_Rogers)
#### Post date: [March 29, 2023, 5:28am UTC](https://discourse.julialang.org/t/discrete-optimization/96731/6 "2023-03-29T05:28:37Z")
The constraints are not linear or quadratic.