顶点所对应的可行解称为基本可行解。
Feasible solution corresponding to the vertex is called a basic feasible solution.
可行解的适应度函数反映目标函数值的大小；
The fitness function of the feasible individual reflected the objective function value;
然而，有的不可行解中往往蕴含着有价值的信息。
However, some infeasible solutions maybe have more useful information.
讨论一般信息选择问题中的属性、条件和可行解的关系。
The general information problems with relation to attribute, requirement and feasible solution are discussed.
对其解的特性、可行解空间的划分及吸引区特性进行了研究。
The properties of the solutions and the region of attraction, the division of the feasible solution space are investigated.
在该解空间中搜索出符合装配集合模型类型和数目的可行解；
Then it searches for the feasible solutions in this solution space, suitable for assembly set's model type and its quantity.
然后依据对偶问题的解，以启发式方法构作原问题的可行解。
A heuristic method is then proposed to construct a feasible solution of the original problem.
该算法通过构造子问题来寻找优于当前局部最优解的可行解。
In this algorithm, a subproblem is set up to search for a new feasible point at which the value of the objective function is lower than the current local minimum.
新算法可行解定义范围增大，求解过程检验数不局限为一种符号。
The definition of feasibility solution in the new algorithm is expended. The checkout number does not need to be same sign in the process of finding solution.
另外，该算法可有效避免陷入局部最优，也不要求提供初始可行解。
Otherwise, the hybrid algorithm can avoid trapping in local optimum and does not need initial feasible solution.
因基本可行解的个数有限，故经有限次转换必能得出问题的最优解。
Due to the limited number of basic feasible solution, it will be converted by the finite optimal solution can be reached.
针对这一问题，文章提出了求非负变量等式约束基本可行解的一种方法。
In this paper, the authors establish a new method of finding the base feasible solution for linear program subject to non-negative variables and equality constraints.
本文给出了用代理约束选取混合整数线性规划问题初始可行解的一种方法。
In this paper, a method using surrogate constraint to select an initial feasible solution of a mixed integer linear programming problem is presented.
传统的优化方法只能适用于可行解域不是非常大的且定义非常明确的问题。
The conventional method is only applicable to that the practical solution domain is not very large and the problem is very clearly defined .
其次， 运用极大代数求出起点至终点的最短路，即获得模型的一个可行解；
Secondly, the max-plus algebra and the max-plus algebra are used to solve the shortest path that is the admissible solution.
本文重点对如何得到下一时刻的可行解进行了研究，指出了衰减系数的上界应满足的条件；
The paper emphasizes on how to get the feasible solution at next time and gives the condition that the decaying coefficient should satisfy.
由于大大减少了粒子在非可行解区域内寻优的概率，因而有效地提高了算法的精度和速度。
The accuracy and speed of the algorithm are improved because the particles will rarely search in the infeasible solutions area.
遗传算法求解有约束组合优化问题是对目标函数在整个遗传空间中搜索满足约束条件的可行解。
GA to solve constrained optimization problem is searching the feasibility answers satisfied the constraint condition in the global genetic type space.
详细分析了解空间性质，提出了用额外关系表示一个可行解的方法，给出了这种表示方法的理论依据。
After analyzing the solution space in detail, a new solution representation based on the extra relation was provided as well as the theoretical basis of this representation.
通过对运输问题的约束条件的分析，重新设计了初始种群的生成方法，避免了对大量非可行解的处理。
It proposes a method to product initial feasible solutions of transportation problem, on the basis of its special constrained conditions, and the unfeasible solutions need not to care any more.
本文研究了一类神经网络优化特性的一些问题。对其解的特性、可行解空间的划分及吸引区特性进行了研究。
Some properties of neural optimization are studied in this paper. The properties of the solutions and the region of attraction, the division of the feasible solution space are investigated.
理论上的分析和计算的例子表明用这种方法得到的初始可行解是令人满意的，嵌入分支定界法可以提供好的界。
The theoretical analysis and computational examples show that the initial feasible solution obtained by the method is satisfactory, which can provide good bounds in branch and bound procedures.
与传统恢复容量算法相比，该算法在可行解搜索空间及计算量上大大降低，为算法在工程上的实现提供了可行性。
Comparcel with other restoration capacity methods, this algorithm reduces the calculation work significantly, which facilitates the application of algorithm on projects.
基于该编码方法所建立的DNA计算模型可用于求解0-1规划问题，只需4次PCR反应即可读取问题的可行解。
By using this method a DNA algorithm to solve 0-1 programming problem is proposed and PCR is done only 4 times of to detect the feasible solutions.
通过对线性规划可行解的分析，讨论了在线性假设下，改变决策单元数据时DEA -DA模型的灵敏度分析问题。
Through the analysis of the feasible solution of the linear programming, the sensitivity analysis of DEADA on linear assumption in the errors of sampled observations was discussed.
首先回顾了采用最钝角行、列主元规则求解线性规画问题的原始、对偶可行解的主要过程，阐述了其与众不同的特性。
First, the main procedures and the distinctive features of the most-obtuse-angle (MOA) row or column pivot rules are introduced for achieving primal or dual feasibility in linear programming.
该结构优化问题的决策变量采用了向量表示方法，建立0-1整数非线性规划模型，给出了可行解存在性的判定方法。
Expressing decision variables of the structure optimization problem in the form of vector, a 0-1 integer nonlinear programming model is presented.
该结构优化问题的决策变量采用了向量表示方法，建立0-1整数非线性规划模型，给出了可行解存在性的判定方法。
Expressing decision variables of the structure optimization problem in the form of vector, a 0-1 integer nonlinear programming model is presented.
应用推荐