可行点 meaning in English
feasible point
Examples
- Dual algorithm shows its advantage over other algorithms for its non - need for finding initial feasible point . 4
由于该算法不需要寻找初始可行点，因此比可行方向法和其他需要初始可行点的算法具有更大的吸引力 - Two examples were illustrated and the results demonstrate that the proposed method can effectively solve the nlp and minlp models for wastewater treatment network optimization with strong ability for global optimization without relying on an initial point
算例问题的求解计算表明，提出的废水处理网络粒子群优化方法具有不要求初始可行点以及适应全局优化等优点，能够快速有效地解决废水处理网络最优化问题。 - 2 . this paper advanced mixed integer nonlinear programming ( minlp ) algorithms mixed with constraint programming ( cp ) to solve industrial process hybrid model mixed with logical rule . cp methods have proved to be successful in solving highly constrained discrete optimization and feasibility problems . it can effectively solve hybrid model mixed with logical rule by integrating cp , nonlinear programming and mixed integer linear programming
本文针对结合逻辑的工业过程混杂模型，提出了结合约束程序( cp )的混合整数非线性规划( mfnlp )算法，采用cp方法求解模型的可行点，并采用milp cp方法求解算法中的milp主问题，通过计算实例可看出，采用这种算法比采用通用的转化成minlp方法的计算时间大为减少。 - Then we propose the problems that will be discussed in the following papers . also , we introduce the theory in the field of feasible region for semi - infinite programming , and concluded that in some area around the feasible points , feasible region can be expressed by finite inequality constraints , this results gives a base to the following algorithms
接着介绍了半无限规划可行域的结构和稳定点的稳定性，指出了关于可行域结构理论研究的现状，并指出在一定的条件下，在可行点的局部邻域内，可行域可以有有限个不等式约束来表示，这为第二、三章半无限规划问题的算法提供了理论基础。 - But j . v . outrata , m . kocvara , et . al . pointed out in 1998 that the equivalent ssnp did n ' t satisfy the weaker mangasarian - fromotitz constraint qualification in any feasible points . so it will be very difficult to get the solution of lcp by means of existing methods for ssnp such as sequential quadratic programming ( sqp for short ) type algorithms , sequential systems of linear equations ( ssle for short ) type algorithms
Kocvara等人在1998年指出了等价的ssnp在任何可行点处都不满足比较弱的mangasarian - fromotitz约束规格，因此，通过用已有的求解ssnp的一些方法如序列二次规划(简记为sqp )类算法、序列线性方程组(简记为ssle )类算法解等价的ssnp来获得线性互补约束问题的解，会有相当的困难