边界约束阻碍了目标函数达到更为优化的值。
A bounded constraint prevents the objective function from reaching a better value.
目标函数称为z，它等于3x1 +2x2。
The objective function is named z and equals 3x1 + 2x2. Note that
第一部分显示解是最佳的，目标函数约等于172667。
The first section shows that the solution is optimal and that the objective function equals approximately 172667.
因此在这个可行域中有多个点对于目标函数来说会产生相同的值。
So there are multiple points in the feasible region that yield the same value for the objective function.
举例来说，在目标函数中，系数3和1就是问题数据集的一部分。
For example, in the objective function, the coefficients 3 and 1 are part of the problem's data set.
排序是把有限资源分配给一些任务以优化某个目标函数。
Scheduling is conserned with allocating limited resources to tasks to optimize certain objective functions.
因此，如果x2变量还可以再变化，那么目标函数的值只会变化0。
Therefore, the x2 variable would change the value of the objective function by 0 if it could ever be relaxed.
注意这种改进依赖于我们的目标是要对目标函数进行最大化还是最小化。
Note that the improvement depends on whether the goal is to minimize or maximize the target function.
现在的问题是，是否可以用同样简单的单目标函数可以完成。
The question is whether this can be done with the same simplicity possible for single objective functions.
在此基础上，以壳体重量为目标函数对结构进行了优化设计。
The structure is then optimized based on above methods, taking structure weight as objective function.
第20行定义了目标函数，它是Rylon公司的利润(收入-成本)。
Line 20 defines the objective function, which is just Rylon's profit (revenue - costs).
类似地，如果我们将糖约束放松一个单位，那么目标函数就会改进0.075。
Analogously, if we could relax the sugar constraint by one unit, the objective function would improve by 0.075.
放松限制的目标函数(不将决策变量当作整数考虑)的优化值同时也给出来了。
The optimal value of the relaxed objective function (the one that didn't consider the decision variables as integers) is also printed here.
第一部分说明所找到的解决方案是整型优化的，为目标函数找到的最小值是23。
The first section says that the solution found is integer optimal, and that the value found for the objective function is 23, a minimum.
分段开关优化配置是一种以可靠性费用最小为目标函数的组合优化问题。
Optimal placement of switch device is a combinatorial optimization problem with reliability cost objective function.
iso - quanta是由具有相同目标函数值的点所构成的空间中的一条线。
An iso-quanta is a line in space formed by points with the same objective function value.
传统的优化设计仅以最低造价为目标函数，没有考虑结构的受力性能指标。
The traditional optimization design is only based on the minimum cost objective function and does not consider the mechanical analysis target.
在公共可行域内优化各个截面的转角，然后加权平均得到目标函数的最优值。
All cross section rotating Angle is optimized in the feasible zone, and the optimal value of target function is calculated.
在建立优化目标函数过程中采用座标形式为未知量，从而使计算公式更为简单。
For establishing the optimal target function we use the coordinate values as the unknown variables and thus the calculating formulas are further simplified.
换而言之，当约束使用新的(x 1,x2)对时，x2的变化不会引起目标函数值的变化。
In other words, a change in x2 won't change the objective function's value, given that the constraint holds for the new (x1, x2) pair.
然而，士兵需求是没有边界的，因此其状态是B，这个约束中的放松不会改变目标函数的优化值。
The soldier demand, however, is not bounded, thus its state is B, and a relaxation in it will not change the objective function's optimal value.
阐明不同动态目标函数时系统参数优化值不同，从而使系统具有不同的跟随性和抗扰性。
The system with different dynamic target functions has different optimized parameters, so the output tracking and anti-load variation capabilities are different.
最小弯曲能量法以结构的弯曲应变能为目标函数，通过求出最小弯曲能量来求得合理索力。
The least bending energy method takes the bending energy as the objective function, and gets the reasonable cable forces by seeking the least bending energy.
与线性双层规划的有关结果相比较，该文在目标函数和所要求满足的条件两方面都有推广。
As compared with the corresponding results in the linear bilevel programs, our generalizations are two-fold: the objective function and the condition that should be satisfied.
本文在比较基于能量的各种算法的基础上提出了建立目标函数，用梯度法实现定位的算法。
Based on the comparison of different algorithms of energy, we create a target function, and use grads method to realize localization.
噢，这个问题是如此简单，问题数据都作为声明中决策变量的系数直接包含在了目标函数和约束声明中。
Well, this problem is so simple that the problem data is directly included in the objective function and constraints declarations as the coefficients of the decision variables in the declarations.
一次只尝试放松每个边界约束一个单位，解决修改后的问题，看一下目标函数的优化值发生了什么变化。
Try relaxing the value of each bounded constraint one at a time, solve the modified problem, and see what happens to the optimal value of the objective function.
最后，我们讨论了整型问题的可行域的可视化问题，以及整型和相关放松限制问题的目标函数的处理方法。
Finally, I discussed feasible region visualization for an integer problem and the way it relates to the objective function for an integer and for the corresponding relaxed problem.
最后，我们讨论了整型问题的可行域的可视化问题，以及整型和相关放松限制问题的目标函数的处理方法。
Finally, I discussed feasible region visualization for an integer problem and the way it relates to the objective function for an integer and for the corresponding relaxed problem.
应用推荐