Algorithm to transform an arbitrary MIP problem into the corresponding formulation for PSO
Ok, I have found how to do this by reading Introduction to Mathematical Optimization: From Linear Programming to Metaheuristics. Chapters 7 and 10 clearly explain the possibilities, essentially the penalty method and the use of Lagrange multipliers coupled with Kuhn-Tucker conditions if necessary.