The first step of the corner point method is to find the feasible region and its:

1. The method tests candidate points rather than searching the whole region. 2. The candidates have to be located before anything is evaluated. 3. Step one is to find the feasible region and determine its corner points. 4. They may be found by inspection or by solving the intersecting lines. _Source: syllabus Mathematics Part II, Ch 12 'Linear Programming'_