有这样一道题 :已知实数x1,x2 ,… ,xn,满足x21+x22 +… +x2 n=1 ,当n≥ 3时 ,求maxi≠jmini≠j|xi-xj|.这是一个二次规划问题 ,但目标函数有些特殊 ,日常生活中“矮子里拔将军”之类说法 ,可看做它的背景 .这类问题 ,似乎并没有一个成熟的解法 .本文试加以探索 .题目要求我们 There is such a question: Known real numbers x1, x2, ..., xn satisfy x21+x22 +... +x2 n=1, when n ≥ 3, find maxi≠jmini≠j|xi-xj|. This is a two The problem of sub-planning, but the objective function is somewhat special, in everyday life “the dwarf who pulls out the general” and the like, can be viewed as its background. This type of problem does not seem to have a mature solution. This article tries to explore. The topic requires us