Several algorithms for the solution of two point boundary value problems associated with Van der Pol's oscillator and rocket trajectory optimization problem are considered.
A comparative evaluation of the algorithms is made to determine the relative merits of each method.
Particular attention is given to such characteristics as the importance of initial guess, the number of iteration, the computing time required, the grid sensitity, the difficulty of programming and the computer storage requirements.
