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.
摘要本文对线性规划提出了一个不可行内点原始-对偶仿射尺度算法，并证明了算法是一个多项式时间算法。
This paper presents an improved (infeasible) simplex method for linear programming, in which some of vertex points, corresponding to the iterative process, can be out of the feasible domain of (LP).
提出了一种求解线性规划(LP)的改进的单纯形法，其迭代过程产生的一部分极点可能出现在可行域外成为不可行极点，因此称之为外点单纯形法。
Our country large number of historic cities, widely distributed, resources and diverse, rich content, during developing historic city tourism resources, it is infeasible that using the same method.
我们国家历史文化名城因数量多，分布广、资源多样、内涵丰厚，使得历史文化名城旅游资源开发方式不得千遍一律。
Our country large number of historic cities, widely distributed, resources and diverse, rich content, during developing historic city tourism resources, it is infeasible that using the same method.
我们国家历史文化名城因数量多，分布广、资源多样、内涵丰厚，使得历史文化名城旅游资源开发方式不得千遍一律。
应用推荐