For satisfying the requirements of the time and space, it is reasonable and natural to compute certain sub-optimal feasible solution, and heuristic methods are designed based on such an idea.
为了满足求解此问题的时间、空间要求，寻找某个次优的、可有效计算的可行解成为自然而合理的办法。启发式方法就是基于这一思想所设计出的。
In the first feasible region above, the optimal solution is the right vertex of the solution space.
在上面的第一个可行域中，优化解决方案是解析空间中的右顶点。
In the first feasible region above, the optimal solution is the right vertex of the solution space, which is a triangle made by all the constraints.
在上面的第一个可行域中，优化解决方案是解析空间中的右顶点，而这个解析空间是一个由所有约束构成的三角形。
Recall that the optimal solution is always on one of the vertices of the polyhedron created by the feasible region.
最佳解通常都是其可行域所构成的多面体的一个顶点。
The optimal solution would still be the integer point (2, 0), though more integer points are feasible now.
优化解决方案仍然是整数点(2,0)，不过现在可行域中有更多整数点了。
Direct search feasible direction (DSFD) is an effective algorithm for solving the constrained non-linear programming problem, however, it could only find the local optimal solution.
转轴直径搜索可行方向法(DSFD方法)是一种比较有效的求解有约束非线性规划问题的算法，但它只能得到局部最优解。
The Transportation Problem exists"more-for-less"paradox, which because the loose-constrained model has broadened the restriction, enlarged the feasible area, and bring new optimal solution.
运输问题存在“多反而少”现象，这是由于在松约束模型中放宽了约束条件，使得可行域变大，产生了新的最优解。
Due to the limited number of basic feasible solution, it will be converted by the finite optimal solution can be reached.
因基本可行解的个数有限，故经有限次转换必能得出问题的最优解。
The idea of this algorithm is to find the optimal solution in the feasible region by an iterative step from one basic standard hyperplane to another.
此算法的基本思想是在规划问题的可行域中由所建的一个切割面到另一个切割面的不断推进来求取最优的。
The optimal solution and data analysis showed the model based on entropy principle was feasible and effective.
算例的优化结果和数据分析表明了此模型的可行性和有效性。
The optimal solution and data analysis showed the model based on entropy principle was feasible and effective.
算例的优化结果和数据分析表明了此模型的可行性和有效性。
应用推荐