In this algorithm, a subproblem is set up to search for a new feasiblepoint at which the value of the objective function is lower than the current local minimum.
该算法通过构造子问题来寻找优于当前局部最优解的可行解。
2
You want to minimize the points of contact between your program and the database so that if you change systems at some point, the change is actually feasible.
需要使程序与数据库之间的联系点尽可能少，以便在某个点更改系统时，可以顺利进行更改。
3
A problem with multiple solutions has more than one point in its feasible region that either maximize or minimize a problem.