Sequential linear programming methods have been successfully
used to solve some sphere and circle problems. Indeed, empirical evidence shows that these frequently find the required solutions in one step. An analysis is presented here which attempts to give an explanation of this phenomemon