标题： 爬升LP算法 显示英文标题

标题： Climbing LP Algorithms

摘要： NP（搜索）问题允许对解的正确性进行简单的测试。 爬山算法也允许在运行过程中的任何阶段轻松评估配置距离得出正确答案有多近。 这提供了很大的灵活性，因为可以立即评估任何偏离标准程序的偏差是否合理。 一个例子是线性规划的对偶矩阵算法（DMA），其变体由A.Y. Levin于1965年和Yamnitsky及我在1982年提出。 它对数值误差和不等式的数量不太敏感。 它提供了显著的灵活性，因此具有进一步发展的潜力。 显示英文摘要

摘要： 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.