Chapter Six Basic Algorithms The tremendous power of the simplex method is a constant surprise to me. G. Dantzig · How does one compute the solution of an optimization problem numerically by an iterative procedure? 6.0 SUMMARY Nonlinear optimization is difficult. The most important thing to realize is that it is in principle impossible to have an algorithm that can solve efficiently all nonlinear optimization problems. This