The existence of strongly polynomial-time algorithm for linear programming is a cross century international mathematical problem, whose breakthrough will solve a major theoretical crisis for the development of artific...
详细信息
ISBN:
(纸本)9781450391153
The existence of strongly polynomial-time algorithm for linear programming is a cross century international mathematical problem, whose breakthrough will solve a major theoretical crisis for the development of artificial intelligence. In order to make it happen, this paper proposes three solving techniques based on the conecutting theory: 1. The selection of cutter: principles highest vs. deepest;2. The algorithm of columnelimination, which is more convenient and effective than the Ye-columnelimination theorem;3. A step-down algorithm for a feasible point horizontally shifts to the center and then falls down to the bottom of the dual feasible region D. There will be a nice work combining three techniques, the tri-skill is variant Simplex algorithm to be expected to help readers building the strong polynomial algorithms. Besides, a variable weight optimization method is proposed in the paper, which opens a new window to bring the linear programming into uncomplicated calculation.
暂无评论