可行基（feasible basis）：对应于基可行解的基称为可行基。 线性规划的基本概念 线性规划的基矩阵、基变量、非基变量 = = 目标函数 约束条件 行列式≠0 基...
基于46个网页-相关网页
对用矩阵的初等变换求线性规划的无初始可行基问题进行了探讨。
The paper probes into the solution, by means of the matrix elementary transformation, of the non-elementary feasible base of linear program.
与惩罚函数法相比，可行基规则不需要额外的参数，且指引粒子迅速飞向可行域。
In contrast to the penalty function method, the rule requires no additional parameters and can guide the swarm to the feasible region quickly.
对没有现成可行基的线性规划问题，目前都采用传统的引进辅助规划问题的方法求解。
People solve linear programming problem without ready-made feasible basis often adopting traditional method by introducing an auxiliary programming problem.
应用推荐