  NP (search) problems allow easy correctness tests for solutions. Climbing
algorithms allow also easy assessment of how close to yielding the correct
answer is the configuration at any stage of their run. This offers a great
flexibility, as how sensible is any deviation from the standard procedures can
be instantly assessed.
  An example is the Dual Matrix Algorithm (DMA) for linear programming,
variations of which were considered by A.Y. Levin in 1965 and by Yamnitsky and
myself in 1982. It has little sensitivity to numerical errors and to the number
of inequalities. It offers substantial flexibility and, thus, potential for
further developments.
