This paper generalizes the notion of set of ε-proper equilibria to polymatrix games. We use 0-1 mixed quadratic and linear programming optimization results to identify proper and non-proper Nash equilibria. We then show how to generate proper equilibria analytically. Finally, we define a 0−1 mixed linear program which returns a proper equilibrium when ε converges to 0.