Merge pull request #180 from emmanuel-ferdman/main

Update `constrained.py` reference

notebooks/SolvingConstrainedProblems.ipynb

@@ -46,7 +46,7 @@
    "id": "adef8444",
    "metadata": {},
    "source": [
-    "The constraint hanlding mechanism included in jMetalPy is the one used by NSGA-II (see again [DPA02](https://doi.org/10.1109/4235.996017)), which is based on computing the overall constraint violation degree of a given solution. This degree is calculated by summing the degrees of violation of all constraints when their value is less than zero, so we have to re-formulate the constraints:\n",
+    "The constraint handling mechanism included in jMetalPy is the one used by NSGA-II (see again [DPA02](https://doi.org/10.1109/4235.996017)), which is based on computing the overall constraint violation degree of a given solution. This degree is calculated by summing the degrees of violation of all constraints when their value is less than zero, so we have to re-formulate the constraints:\n",
     "\n",
     "$$\n",
     "g_1(\\vec{x}) = 1.0 - (x_1 * x_1 + x_2 * x_2) / 225.0\n",
@@ -61,7 +61,7 @@
    "id": "6b331892",
    "metadata": {},
    "source": [
-    "We can implement problem Srinivas in two ways. The first one is by extending the ``FloatProblem`` abstract class (see [Srinivas](https://github.com/jMetal/jMetalPy/blob/main/jmetal/problem/multiobjective/constrained.py)) and the second one is by using the ``OnTheFlyFloatProblem()``class. We use the second approach:"
+    "We can implement problem Srinivas in two ways. The first one is by extending the ``FloatProblem`` abstract class (see [Srinivas](https://github.com/jMetal/jMetalPy/blob/main/src/jmetal/problem/multiobjective/constrained.py)) and the second one is by using the ``OnTheFlyFloatProblem()``class. We use the second approach:"
    ]
   },
   {
@@ -124,7 +124,7 @@
    "metadata": {},
    "source": [
     "## Configuring NSGA-II \n",
-    "The constraing handling mechanism of NSGA-II consists of first checking the overall constraint violation degree of the solutions to be compared; if both are feasible or have the same degree of violation, a dominance test is applied. These steps are carried out by the ``DominanceWithConstraintsComparator`` class. \n",
+    "The constraint handling mechanism of NSGA-II consists of first checking the overall constraint violation degree of the solutions to be compared; if both are feasible or have the same degree of violation, a dominance test is applied. These steps are carried out by the ``DominanceWithConstraintsComparator`` class. \n",
     "\n",
     "An example of NSGA-II configuration to solve the Srinivas problem is the following:"
    ]