Integration of a primal simplex network algorithm with a large-scale mathematical programming system
ACM Trans. Math. Softw.(1985)
摘要
In this paper we discuss the implementation of a primal simplex algorithm for network problems in the MPSIII mathematical programming system. Because of the need to interface with the rest of the MPS this implementation is unorthodox, but computationally effective, and has a number of advantages over “stand alone” network optimizers. It is argued that a similar approach is appropriate for other general-purpose mathematical programming systems, and has applications beyond pure network optimization.
更多查看译文
关键词
mpsiii mathematical programming system,network problem,primal simplex algorithm,supersparsity,additional key words and phrases: mathematical programming systems,similar approach,pure network optimization,network problems,general-purpose mathematical programming system,large-scale mathematical programming system,primal simplex network algorithm,network optimizers,sparsity,mathematical programming,simplex algorithm
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络