1) Feasible basis
可行基
1.
[1]described a method for obtaining a feasible basis.
文[1]给出一个求线性规划问题可行基的方法,文[2]指出其判定条件(3)有误,然而所用的反例并不正确。
2.
In this paper,the author puts forward a way of producing an initial feasible basis to a special kind of linear programming,that is,firstly obtain an initial basis by making use of the plausible character of the optimal basis,and then obtain an initial feasible one by the ratio test free rule.
本文对一类特殊的线性规划问题提出了利用最优基的启发性刻划产生初始基 ,进而用无比检验规则产生初始可行基的方法 ,并给出了此方法在单纯形表上实现的步骤。
2) feasible base
可行基
1.
The paper probes into the solution, by means of the matrix elementary transformation, of the non-elementary feasible base of linear program.
对用矩阵的初等变换求线性规划的无初始可行基问题进行了探讨 。
3) basic feasible solution
基可行解
1.
The properties of the basic feasible solution of a linear programming problem are studied.
对线性规划问题基可行解的性质进行了研究，给出了一种求解线性规划问题初始基可行解的算法，该算法的时间复杂度是约束条件个数的线性函
2.
When finding the first basic feasible solution for subject to Ax=b,we needn t use the ortificial variable.
本文提出解线性规划问题的一种方法，主要是对约束Ａｘ＝ｂ求初始基可行解时，不必引入人工变量而可直接用旋转运算获得，之后就完全和单纯形法一样求最优解。
3.
A basic feasible solution is found only to reguire one or two itrations.
在文 [1]基础上提出一个全搜索方法 ,它通常只需迭代一、二次 ,即可得到一个基可行解。
4) feasible basic solution
可行基解
5) basic feasible solution
基本可行解
1.
The basic feasible solution is introduced to the conic programming,the relations of the optimal solution,the basic feasible solution and the extreme point of the feasible region are discussed,and finally the conditions for the solution of a conic programming are gotten.
将线性规划的基本可行解等概念引入到锥规划中,讨论了锥规划的解、基本可行解及可行域顶点的关系,最终利用对偶锥的概念得到了锥规划解判别方法。
2.
With a dual cone,the dual programming and the basic feasible solution are introduced to conic programming,the relations between them and the optimal solution are discussed,the conditions for the optimal solution are gotten,and the main dual properties are studied,about conic programming.
利用对偶锥的概念,将对偶规划和基本可行解等概念引到锥规划中,讨论了这些概念和最优解的关系,给出了锥规划最优解的判别方法,研究了锥规划对偶规划的主要性质。
3.
The structural form of countless optimal solutions is given when there is only one optimal basic feasible solution for linear programming.
线性规划只存在一个最优基本可行解时,推导出无穷多最优解的结构形
6) initial feasible basis
初始可行基
1.
Algorithm realization of solving initial feasible basis
求解初始可行基的算法实现
2.
An association between the elementary transformation of matrix and the concept of initial feasible basis is established,and then,a determination way for initial feasible basis of linear programming is presented.
通过对单纯形求解法的实质的分析和认识,提出了基于矩阵初等变换初始可行基的获得方法,进而得到基于单纯形法的求解线性规划模型的直接方法,省略了以往为选择解法而进行的分析判断,使单纯形法的运用简便明了。
补充资料：2-甲氧基碳酸基乙基胺基乙基胺基丙基三甲氧基硅烷
CAS: 1067-66-9
分子式: C12H28N2O5Si
分子量: 308.45
中文名称: 2-甲氧基碳酸基乙基胺基乙基胺基丙基三甲氧基硅烷
英文名称: [N'-(2-Methoxycarbonylethyl)aminoethylaminopropyl]trimethoxysilane
10-diaza-3-silatridecan-13-oic acid, 3,3-dimethoxy-2-oxa- methyl ester
n-(2-((3-(trimethoxysilyl)propyl)amino)ethyl)-beta-alanin methyl ester
methyl 3,3-dimethoxy-2-oxa-7,10-diaza-3-silatridecan-13-oate
methyl[2-(3-trimethoxysilylpropylamino)-ethylamino
分子式: C12H28N2O5Si
分子量: 308.45
中文名称: 2-甲氧基碳酸基乙基胺基乙基胺基丙基三甲氧基硅烷
英文名称: [N'-(2-Methoxycarbonylethyl)aminoethylaminopropyl]trimethoxysilane
10-diaza-3-silatridecan-13-oic acid, 3,3-dimethoxy-2-oxa- methyl ester
n-(2-((3-(trimethoxysilyl)propyl)amino)ethyl)-beta-alanin methyl ester
methyl 3,3-dimethoxy-2-oxa-7,10-diaza-3-silatridecan-13-oate
methyl[2-(3-trimethoxysilylpropylamino)-ethylamino
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条