Solvers used


  1. GLPK solver:

!apt-get install -y -qq glpk-utils

  1. CPLEX solver

!pip install cplex -q

  1. IPOPT solver

!wget -N -q "https://ampl.com/dl/open/ipopt/ipopt-linux64.zip"

!unzip -o -q ipopt-linux64

  1. COUENNE solver

!wget -N -q "https://ampl.com/dl/open/couenne/couenne-linux64.zip"

!unzip -o -q couenne-linux64

  1. BONMIN solver

!wget -N -q "https://ampl.com/dl/open/bonmin/bonmin-linux64.zip"

!unzip -o -q bonmin-linux64

 


Comments

Post a Comment

Popular posts from this blog

Section 5 Challenge Problem: Traveling Salesman

Winston and Goldberg 2004 Pg 532 You *have* to visit all cities (demand). What order will minimized the cost (total distance)? Solve it using integer programming. You're give the table of distances between cities. Set up the problem so you don't return to Ci immediately after leaving Ci. And also, a workaround for sub-tours - 3-4-3 (started from 3 and only visited 4) is not acceptable. 3-4-1-2-5-3 is acceptable (though may not be lowest cost). I didn't follow the lesson, but, this is probably so well known that, if you had to do it, you could just use chatGPT to knock it out..
Read more

Section 6 Problem 2 - Beautiful - Shipping Balls in a Box - Minimize the Surface Area (that's material)

Reduce it to 2D - it's circles inside a rectangle - now minimize the perimeter. A lovely problem. When you ship the balls, you pay for material - who cares about the volume - you want to minimize the area of the material only. In the 3D case, the height is set by the largest. What about the W and L? That nicely, naturally, reduces to the 2D case.. Intuitively, it's about maximizing area while minimizing perimeter. If the balls (there are three) aren't all touching each other and the edges, you're wasting space. I guess you could just set this up with variables (positions of the three circles) and parameters (circle sizes) and let the optimizer handle it. You just need constraints that keep any two circles' centers r1 + r2 apart. (They can touch, but not overlap)
Read more