线性规划最优解集的数学理论与计算方法
heory and Algorithm for Optimal Solution Set of Linear Programming
本文导出了线性规划最优解集的连续性、切向等值性、唯一性和法向严格单调性四大特征,建立了线性规划最优解集的一个充分必要条件,创立了线性规划最优解集的一种算法并在深入讨论算法时间复杂度定义的基础上证明了该算法是多项式时间算法。
his paper deliberates on the optimal solution set of linear programming. Four characteristic properties and a necessary-sufficient condition for the set have been established, and as a result of that we obtained an algorithm for the set. An in-depth discussion about the definition of time complexity was developed and on the basis of which we concluded that the algorithm is polynomial.
彭岳林
数学
线性规划最优解集充分必要条件时间复杂度多项式时间算法
linear programmingoptimal solution setnecessary and sufficient conditiontime complexitypolynomial algorithm
彭岳林.线性规划最优解集的数学理论与计算方法[EB/OL].(2011-01-19)[2025-08-16].http://www.paper.edu.cn/releasepaper/content/201101-1021.点此复制
评论