surrogate constraint

基本解釋

In this paper, a method using surrogate constraint to select an initial feasible solution of a mixed integer linear programming problem is presented.
本文給出了用代理約束選取混合整數(shù)線性規(guī)劃問題初始可行解的一種方法。
This reproduction considers both the fitness values and constraint function values calculated by surrogate function, which ensures potential designs to be chosen preferentially.
利用凝聚函數(shù)求出個體的約束違背值，在選擇中不僅考慮適應度值而且考慮約束違背值，使有潛力的個體優(yōu)先被選擇。
The conventional surrogate constraint method, which can improve the efficiency of branch-and-bound or cutting plane algorithms, can not guarantee to find the optimal solution of the primal problem.
本文介紹了混合整數(shù)兩層線性規(guī)劃問題，引入代理約束，構造計算簡單的定界函數(shù)，提出一個分支定界算法，并給出算例說明算法是有效的。