Simplex N-Dimensional Minimization with bounds / constraints

N-Dimensional function minimization using the Simplex approach incorporating bounds and constraints

Two N-degree function minimization solvers based on the Simplex approach that include equality / inequality constraint as well as bound limit capabilities. Purpose was to test out ideas for improving minimization process to reject or avoid local minimums. Solvers are thought experiments reduced to practice. Feedback is welcome though response times might be a bit slow as this is a hobby.