Simplex Algorithm

Linear programs like this can be solved with the simplex algorithm.

Simplex starts at a vertex in the feasible region, in our case the origin at (0, 0), and continuously looks for a neighbor vertex of better value.

It's a hill-climbing method executed on the vertices of the polygon, walking from neighbor to neighbor in order to increase profit along the way. For example: