返回
O(n3) noniterative heuristic algorithm for linear programs with error-free implementation
DOI:10.1016/S0096-3003(99)00004-1.png)
摘要
En 中文
We present an O(n(3)) noniterative heuristic algorithm and describe an implementation of p-adic arithmetic to solve the linear programming problems error-free. An optimality test as well as numerical examples depict the scope of such an algorithm. In the few cases where it did not lead to the optimal solution, it did provide a nonnegative solution of the system Ax = b, which could be used as the basic feasible solution for any one of the widely used simplex methods, say, the revised simplex algorithm without the need to include artificial variables in .4x = b for consistency check. Thus the algorithm could be at least a pre-processor for any simplex algorithm and avoids the enhancement of dimensions of the constraint matrix A and consequent additional space, computational complexities, and errors. (C) 2000 Elsevier Science Inc. All rights reserved.
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
暂无机构信息
引用论文
Enzymology with a Spin-Labeled Phospholipase C: Soluble Substrate Binding by 31P NMR from 0.005 to 11.7 T具有自旋标记的磷脂酶C的酶学: 通过 31P NMR从0.005到11.7 T的可溶性底物结合
Biochemistry
IF0
A randomized prospective study of the immediate outcomes of the use of a hydro-jet dissector and an ultrasonic surgical aspirator for laparoscopic liver resection
HPB
IF0

