 This continues until the maximum value is reached, or an unbounded edge is visited (concluding that the problem has no solution).The algorithm always terminates because the number of vertices in the polytope is finite; moreover since we jump between vertices always in the same direction (that of the objective function), we hope that the number of vertices visited will be small.The solution of a linear program is accomplished in two steps.