Constrained MOO using GA (ver. 2)

Solving a simple MOO problem using Genetic Algorithms (GA)

This code is a demo of using Genetic Algorithms (GA) to solve a simple constrained multi-objective optimization (MOO) problem.
The objective is to find the pareto front of the MOO problem defined as follows:
Maximize:
f1(X) = 2*x1 + 3*x2
f2(X) = 2/x1 + 1/x2
such that:
10 > x1 > 20
20 > x2 > 30

The set of non-dominated solutions is plotted in the objective space, and displayed in the console.