In this paper, a type of Min Max problem with constraints has been discussed and a generalized projection method has been given for solving this problem.
讨论一类带约束的极大极小问题并给出一个广义投影型的算法，利用问题的特性而使算法有较简单的结构。
Expect one about a min/max problem, something about Lagrange multipliers, something about the chain rule and something about constrained partial derivatives.
有一个极值问题，也有关于拉格朗日乘数法的，链式法则也会有的,约束条件下偏导数当然不会漏掉。
Meanwhile, KS function is suitable for dealing with the optimization of Min-Max problem.
同时指出，KS函数很适合求解最小-最大类型的优化问题。
Constructing a simple network and converting the allocation problem into the min-cost max-flow in the network, we have developed an optimal algorithm for the allocation problem.
我们构造了一个简单网络，将布点问题转化为该网络中的最小费用最大流问题，从而给出了求解布点问题的最优性算法。
The test experiments for solving min-max location problem show that the proposed solution can effectively reduce the cost of location problem, and has good application value.
将算法应用于极小极大选址问题的实验结果表明，算法能够有效地求解极小极大选址问题，具有较好的应用价值。
But the algorithm easily trapped into local optimal solution and solved the problem more slowly, this paper constructed Max-Min ACO algorithm through the improvement and adjustment of ACO algorithm.
针对该算法易陷入局部最优解、求解速度较慢的缺陷，本文通过对蚁群算法的改进和调整，构造出最大—最小蚁群算法。
But the algorithm easily trapped into local optimal solution and solved the problem more slowly, this paper constructed Max-Min ACO algorithm through the improvement and adjustment of ACO algorithm.
针对该算法易陷入局部最优解、求解速度较慢的缺陷，本文通过对蚁群算法的改进和调整，构造出最大—最小蚁群算法。
应用推荐