摘要
对文[1]中Kelly的第18个问题,本文证明了p≤d及d=2,P=3,4和d=3,p=4,5时Wolliam Kruskal猜想成立,并给出了m(d,P)的最小值,同时也给出了含10个变量的非线性规划问题的一种解法.
In the paper,we proved the conjecture of Wolliam Kruskal about Kelly's problemin [1] when p≤d and d=2,p=3,4 and d=3,p=4,5.At the same time,we obtained theminimum of m(d,p)and a kind of resolvable method for non-linear programming problem.