说明:双击或选中下面任意单词,将显示该词的音标、读音、翻译等;选中中文或多个词,将显示翻译。
您的位置:首页 -> 词典 -> 非可行解
1)  infeasible solutions
非可行解
1.
This paper will approach some mathematics models of generalized inverse problem according to complementary optimum condition that how to make some infeasible solutions become optimal solutions by adjusting its coefficients like products cost coefficient,resources consumption coefficient and the quantity of owning resources in linear programming for enterprise optimal production plan.
将依据互补最优性条件探讨面向企业最优生产计划的线性规划,如何通过调整其产品成本系数、资源消耗系数和资源拥有量等参数,使某些非可行解成为最优解的广义逆优化问题的数学模型。
2)  non-degenerate basic feasible solution
非退化基本可行解
3)  non-solvable group
非可解群
1.
Let G be a finite non-solvable group and Z(G)=1.
设G是有限非可解群且Z(G)=1。
2.
In this paper, we have proved the following:Theorem Let G be a finite non-solvable group and p be the smallest odd prime divisor of the order of G.
证明了:定理设G为有限非可解群,p为|G|的最小奇素因子。
4)  infeasible solution
不可行解
1.
When genetic algorithm (GA) is used to solve the problems of distribu tion network reconfiguration, the infeasible solution will become a difficult pr oblem.
不可行解是遗传算法应用于配电网重构时遇到的一个难题。
2.
This method searches the solution space of the problem through the admixture crossover of feasible and infeasible solutions,and performs the selection operation on feasible and infeasible populations respectively.
该方法通过可行解和不可行解混合交叉的方法对问题的解空间进行搜索,对可行种群和不可行种群分别进行选择操作。
3.
The construction of infeasible solution to JSSP is analyzed and a necessary and sufficient condition of infeasible solution is given.
讨论 Job shop排序问题不可行解的构造情况 ,给出了不可行解的一个充要条件以及 2台机器n个加工工件的 Job shop问题不可行解和可行解的计算公式 ,并由此得到一种概率模型的计算方法。
5)  feasible point
可行解
1.
Solving feasible point of semi - infinite programming is concerned.
基于极大值函数的极大熵,给出求解半无限规划问题可行解的一个有效算法,在一定的假设下,证明了算法的收敛性。
2.
In this paper,the authors put forward an efficient method for finding the feasible point of optimrm problems.
本文提出了一种求解最优化问题可行解的方法,与已有方法比较,计算量大大减
3.
It is proved that the solutions starting from the neighborhood of a feasible point converge to a feasible point.
本文利用微分方程对一般多目标优化问题及其约束条件进行了讨论,指出在一定条件下,从问题(1)的任一可行解的某邻域内出发,沿微分方程组(3)的轨线,关于部分变元总收敛到问题(1)的可行解。
6)  feasible solution set
可行解集
1.
Mesh generating was employed to display the feasible solution set of ship shafting system alignment in multi-dimension space.
本文在多维空间中 ,求出船舶轴系合理校中可行解集 ,并进行网格划分 ,结合挠度曲线和解在解集空间中的位置等因素 ,搜索出校中的解。
补充资料:非想非非想处天
1.佛教语。即三界中无色界第四天。此天没有欲望与物质﹐仅有微妙的思想。
说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条