Tag Info

Julia JuMP successive optimization

Your question has a two-part answer: how JuMP handles successive solves, and how the solvers handle successive solves. How JuMP handles successive solves Recall that JuMP is a modeling layer, not an ...
• 3,253

For all things convex, Mosek's modeling cookbook and conic modeling cheatsheet have you covered. In your case, see the section on convex quadratic sets.
• 3,253
Accepted

Fleet Management: How to allocate vehicles between departments

If the use of vehicles by departments is deterministic (which I find very unlikely), then scenarios 2 and 3 can be approached as integer programming models. You might be able to do that with random ...
• 28.8k

Fleet Management: How to allocate vehicles between departments

Based on what you described in the question, the problem you are facing is a variant of the vehicle routing problem. If you have faced some uncertainty, as Prof. Rubin mentioned too, the simulation ...
• 5,705

Lin-Kernighan TSP edge choice

In Section 5.3 of K. Helsgaun, General k-opt submoves for the Lin-Kernighan TSP heuristic. Mathematical Programming Computation, 1(2-3):119-163 (2009). it is demonstrated how the feasibility of a k-...
Accepted

• 959