论文部分内容阅读
本文对正项几何规划的多困难度情况提供一个有效的方法，即将困难度为Ｄ的几何规划首先化为Ｄ维线性规划，然后再化为一维搜索问题。结果表明，该法十分有效。
This paper provides an effective method for the multi-difficulty situation of positive geometrical planning. Firstly, the geometrical plan with difficulty degree D is first transformed into D-dimensional linear programming and then transformed into a one-dimensional search problem. The results show that this method is very effective.