# Dynamic programming

**URL:** <https://discourse.julialang.org/t/dynamic-programming/38512>\
**Category:** Optimization (Mathematical)\
**Created:** [April 30, 2020, 10:48pm UTC](https://discourse.julialang.org/t/dynamic-programming/38512 "2020-04-30T22:48:18Z")\
**Posts on this page:** 5\
**Page:** 1

<div class="post-metadata">

**Author:** ![lausilvag](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/lausilvag/32/9778_2.png) [@lausilvag](https://discourse.julialang.org/u/lausilvag)\
**Post date:** [April 30, 2020, 10:48pm UTC](https://discourse.julialang.org/t/dynamic-programming/38512/1 "2020-04-30T22:48:18Z")

</div>

Hi

I am new to Julia and I would like to know if there is any MIP optimization solver that performs dynamic search.

I have an optimization problem that exceeds 1000 variables allowed by student/research CPLEX license.

Cbc and GLPK solvers resolve MIP using Branch and Bound/Cut.

Is there any free solver that performs dynamic search

---

<div class="post-metadata">

**Author:** ![mthelm85](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/mthelm85/32/224164_2.png) [@mthelm85](https://discourse.julialang.org/u/mthelm85)\
**Post date:** [April 30, 2020, 11:31pm UTC](https://discourse.julialang.org/t/dynamic-programming/38512/2 "2020-04-30T23:31:42Z")

</div>

> [@lausilvag](#):
>
> ould like to know if there is any

I have no idea if it will do what you need it to do, but check out JuMP.jl if you haven’t already:

[http://www.juliaopt.org/JuMP.jl/v0.21.1/](http://www.juliaopt.org/JuMP.jl/v0.21.1/)

---

<div class="post-metadata">

**Author:** ![Henrique\_Becker](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/henrique_becker/32/15443_2.png) [@Henrique\_Becker](https://discourse.julialang.org/u/Henrique_Becker)\
**Post date:** [May 1, 2020, 12:12am UTC](https://discourse.julialang.org/t/dynamic-programming/38512/3 "2020-05-01T00:12:50Z")

</div>

I am not sure, but why dynamic search is relevant? Seems to me that the problem is the restriction on the number of variables. I have already set CPLEX/Gurobi to not use dynamic search, just B&B and they do not have a much worse performance because of it.

You mention a 1000 variables limit, I am a PhD student and I have no knowledge of this limit. I use both CPLEX and Gurobi and both allow any number of variables in their academic versions.

---

<div class="post-metadata">

**Author:** ![leethargo](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/leethargo/32/6004_2.png) [@leethargo](https://discourse.julialang.org/u/leethargo)\
**Post date:** [May 1, 2020, 7:16am UTC](https://discourse.julialang.org/t/dynamic-programming/38512/4 "2020-05-01T07:16:48Z")

</div>

The 1000 variable limit is from the CPLEX community license, which is different from the academic license and available to everybody.

---

<div class="post-metadata">

**Author:** ![lausilvag](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/lausilvag/32/9778_2.png) [@lausilvag](https://discourse.julialang.org/u/lausilvag)\
**Post date:** [May 4, 2020, 10:28pm UTC](https://discourse.julialang.org/t/dynamic-programming/38512/5 "2020-05-04T22:28:12Z")

</div>

Thank you for your help!