Mathematical modelling for the problem of distributing seats in an elected assembly

Three mathematical models for the problem of distributing seats are presented, all of which are solved by a grid search algorithm, and use the concept of least-squares in order to describe the fairness associated with the distribution. The modelling procedure is concise, and the algorithms used to solve these models are effective. A large number of numerical experiments provides many useful conclusions for the practical applications of these models.