Determine whether the two classes are linearly separable (algorithmically in 2D)

Question

There are two classes, let\'s call them X and O. A number of elements belonging to these classes are spread out in the xy-plane. Here is an example where the two classes are

Answer 1

As mentioned by ElKamina, Linear Perceptron is guaranteed to find a solution if one exists. This approach is not efficient for large dimensions. Computationally the most effective way to decide whether two sets of points are linearly separable is by applying linear programming.

A code with an example to solve using Perceptron in Matlab is here