# Can we solve IP model with parallel processing?

**URL:** <https://discourse.julialang.org/t/can-we-solve-ip-model-with-parallel-processing/4312>\
**Category:** General Usage\
**Created:** [June 16, 2017, 5:22pm UTC](https://discourse.julialang.org/t/can-we-solve-ip-model-with-parallel-processing/4312 "2017-06-16T17:22:56Z")\
**Posts on this page:** 1\
**Page:** 1

<div class="post-metadata">

**Author:** ![gopal2017](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/gopal2017/32/31747_2.png) [@gopal2017](https://discourse.julialang.org/u/gopal2017)\
**Post date:** [June 16, 2017, 5:22pm UTC](https://discourse.julialang.org/t/can-we-solve-ip-model-with-parallel-processing/4312/1 "2017-06-16T17:22:56Z")

</div>

In Julia parallel processing is possible. For instance, we can try the problem mentioned below:

> nprocs()  
> function Square(n)  
> sum=0  
> for i=1:n  
> sum+=i^2  
> end  
> return sum  
> end  
> @time Square(10000000)  
> Now try with parallel processing  
> addprocs(2)  
> @everywhere function Square(n)  
> sum=0  
> for i=1:n  
> sum+=i^2  
> end  
> return sum  
> end

> @time Square(10000000)

More than 80% computational time we can save.

My simple question is mentioned below:

Can we use same approach to solve IP model with Cbc/Ipopt solver? Please share an example.