基 最优解 ( Basic Optimal Solution ):既是基可行解又是 最优解 n m m m m n C 注意：基可行解的数目<=基解的数目<= m n C 例1：求解下列生产计划问题的基解和基...
基于12个网页-相关网页
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.
此算法的基本思想是在规划问题的可行域中由所建的一个切割面到另一个切割面的不断推进来求取最优的。
Furthermore, it is found that the optimal basic working solution concentration varies with the price ratio of refrigeration to power.
此外，研究表明循环最佳基本工质浓度随冷、电价格比的变化而变化。
应用推荐