In the first feasible region above, the optimal solution is the right vertex of the solution space.
在上面的第一个可行域中，优化解决方案是解析空间中的右顶点。
By using simplex method to solve the LP, the optimal solution of ILP can be obtained.
利用单纯形法求解该线性规划问题，便可得到整数规划的最优解。
After a limited number of iterations, we can get the optimal solution of the primal problem.
在经过有限次迭代之后，可以求得原问题的最优解。
Just know that the optimal solution for a non-integer problem is always one of the polyhedron vertices.
我们只需要知道非整型问题的优化解决方案通常都是一个多面体的顶点就好了。
The optimal solution is to follow the HTML specification and load your stylesheets in the document HEAD.
最佳的解决方案是按照HTML规范，并加载您HEAD文档中的样式表。
An example of determining the balance weight for a mechanism and the optimal solution by SUMT are given.
文中还用这种新方法来确定机构的平衡重，并用SUMT外点法求出了最优解。
Before writing a GNU MathProg program to find the optimal solution for this problem, analyze it a little bit.
在为这个问题寻找最佳解而编写GNUMathProg程序之前，需要对其稍微进行一下分析。
The optimal solution would still be the integer point (2, 0), though more integer points are feasible now.
优化解决方案仍然是整数点(2,0)，不过现在可行域中有更多整数点了。
The transform assures the invariability of the image's moving and scale, and obtains the optimal solution.
这种变换关系保证了图像变换平移不变性和规模不变性，从而保证了全局优化的结果。
The optimal solution and data analysis showed the model based on entropy principle was feasible and effective.
算例的优化结果和数据分析表明了此模型的可行性和有效性。
While giving each user his or her own physical database would solve the problem, it may not be the optimal solution.
给每个用户提供一个他自己专用的物理数据库可以解决这个问题，但是这不是优化的解决方案。
This method can approach local extreme value available, but it is not the optimal solution or optimal resolution.
用这种方法可以有效逼近解的局部极小点，但不一定能得到最佳解或最佳的分辨率。
Recall that the optimal solution is always on one of the vertices of the polyhedron created by the feasible region.
最佳解通常都是其可行域所构成的多面体的一个顶点。
This model has quick convergence, robustness and capability of searching the optimal solution within defined space.
该模型具有快速收敛、鲁棒性和全局最优搜索能力。
Based on the multi constraints fuzzy optimal control model the optimal solution is sought under satisfying constraints.
根据多约束模糊最优控制模型，寻求满足约束前提下的最优解。
The profit functions of supply chain in two compensation cost structure are analyzed and the optimal solution is found.
分别分析了两种补偿成本结构下的供应链收益函数，进行了优化求解。
This paper discusses the optimal solution change, after it is changed to elements of efficiency matrix of assigning problem.
进一步讨论了在保持分派问题最优解不变的情况下，效率矩阵元素的变化范围。
Another question you might ask is: "is the optimal solution of an integer somehow related to its relaxed problem's optimal solution?"
您可能会问的另外一个问题是：“整型问题的优化解决方案与放松限制问题的优化解决方案有关联吗？”
Typically, the optimal solution is to use the local store as much as possible, since it's usually faster than a remote connection.
典型的，最理想的方案是尽可能地使用本地尽可能方案翻译存储，因为它通常比远程连接要来的快速。
In this particular case, the optimal solution for both the integer and non-integer problems is the same, but that's not always the case.
在这种特例中，整型和非整型的优化解决方案是相同的，但是并非所有情况都是如此。
The problem is changed to solving the linear inequality group with two unknown, thus, we can get the optimal solution by the computer.
从而使问题转化成求解二元线性不等式组的问题，为此可方便地借助计算机求出最佳结果。
In the first feasible region above, the optimal solution is the right vertex of the solution space, which is a triangle made by all the constraints.
在上面的第一个可行域中，优化解决方案是解析空间中的右顶点，而这个解析空间是一个由所有约束构成的三角形。
Although it isn't the optimal solution, multiple elif statements can be used to mimic the switch case statement present in some other languages.
尽管它不是最优的解决方案，但是多个elif语句可以用于模拟其他一些语言中的switchcase语句。
The variable ranges of vectors in consumption coefficient matrix for which the optimal solution or optimal basis remain invariable are determined.
求出使最优解或最优基保持最优的消耗系数矩阵中列向量和行向量的可变范围。
Therefore, the optimal solution is the farthest point on the polyhedron boundary from the axis' origin using the direction (1,-1) as a direction vector.
因此，优化解决方案是从轴的原点沿 (1,-1)方向作为方向向量指向多面体边界的最远点。
This paper introduce the optimal solution to the problem of optimizing time and cost by setting up a tableau and modifying the tableau step by step.
本文提出利用列表和在表上逐步进行修改，最终得到工期成本优化问题的最优解的方法。
A class of special nonlinear programming is discussed. The analytic expression of the optimal solution is given. And an example is finally presented.
讨论了一类特殊的非线性规划问题，给出了其最优解的解析表达式，最后给出了一个例子。
The idea of this algorithm is to find the optimal solution in the feasible region by an iterative step from one basic standard hyperplane to another.
此算法的基本思想是在规划问题的可行域中由所建的一个切割面到另一个切割面的不断推进来求取最优的。
The idea of this algorithm is to find the optimal solution in the feasible region by an iterative step from one basic standard hyperplane to another.
此算法的基本思想是在规划问题的可行域中由所建的一个切割面到另一个切割面的不断推进来求取最优的。
应用推荐