摘要本文对线性规划提出了一个不可行内点原始-对偶仿射尺度算法，并证明了算法是一个多项式时间算法。
This paper presents a infeasible interior-point primal -dual affine scaling algorithm for linear programming. it is shown that the method is polynomial-time algorithm.
用稀疏对偶单纯形法求解每时段的经济功率分配，所用内存少，计算时间短。
Small memory capacity and short CPU time are repuired by the algorithm for the solution of the economic dispatch every interval with simple form of sparse dual method.
本文对运输问题的原设-对偶算法运用推拉流思想进行改进，得到一个拟多项式时间算法。
Based on the N-person cooperative game theory, this paper puts forward a model of the minimum cost allocation of transportation problem.
应用推荐