查询词典 convex programming

It is pointed out that optimal solution of linear programming can be represented as a sum of a convex combination of the optimal extreme point s and a nonnegatively linear combination of the optimal extreme directions.

本文指出了线性规划的最优解可表示为最优极点的凸组合和最优极方向的非负线性组合之和，确定了最优极方向存在的条件。

Third,a nonlinear programming model is given for the coexistence of multi-prices on the basis of the convex function model.

再次，在凸需求函数模型下给出多种价格并存的非线性规划模型。

In the more mature areas such as linear programming and unconstrained optimization, and in those of intermediate maturity such as integer and constrained convex optimization, emphasis will be placed on rapid, large-scale computation.

在那些更为成熟的如线性规划和无约束优化等领域和一些不太成熟的如整数和约束优化等领域，研究的重点将被放到快速的，大规模的计算上。

This algorithm is proposed on the basis of the thought as follovvs: as for three dimensional Euclid space, the feasible region of any linear programming problem is a extended convex polyhedron, of which surface is consisted of some planes, and its objective function can be regarded as a parallel plane pencil with objective function value acting as parameter.

如果线性规划问题有最优解，那么过可行域的一已知顶点必至少存在这样一条棱——它以该己知顶点为一端点，可行域的另一顶点为另一端点，并使目标函数在另一端点的函数值优于己知端点的函数值，否则，该己知点就是线性规划问题的最优解。

It is generalization of linear and convex quadratic programming.

这可以被看作是一个特殊情况非线性规划或泛化的线性或凸二次规划。

Moreover,it has generality,and includes the other models for convex quadratic programming.

此外该网络具有一般性，包括了其它解凸二次规划问题的模型。

Based on the theory, a new approach for convex quadratic programming with equality constrains is studied.

第三章介绍了拟牛顿算法，并给出了Armijo型线性搜索和Wolf-Powell型线性搜索。

Based on the primal-dual logarithmic-barrier method, a new algorithm for convex quadratic programming with equality and non-equality constrains is discussed.

在此基础上提出了求解带有等式约束和不等式约束的凸二次规划的牛顿内点算法。

The method of convex quadratic programming relaxation has been used for the scheduling with rejection .

用凸二次规划松弛方法研究工件具有就绪时间，目标函数为工件总拒绝费用与接受工件的带权总完工时间之和的工件可拒绝排序问题，得到界为2的多项式时间近似算法。

Inequality constrained least-square problems are first changed to convex quadratic programming problems and then solved for the optimal solutions.

研究了不等式约束下的平差问题，即先将不等式约束的最小二乘问题转换成凸二次规划问题，然后求其最优解。

However, as the name（read－only memory）implies, CD disks cannot be written onorchanged in any way.

然而，正如其名字所指出的那样，CD盘不能写，也不能用任何方式改变其内容。

Galvanizes steel pallet is mainly export which suits standard packing of European Union, the North America. galvanizes steel pallet is suitable to heavy rack. Pallet surface can design plate type, corrugated and the gap form, satisfies the different requirements.

镀锌钢托盘多用于出口，替代木托盘，免薰蒸，符合欧盟、北美各国对出口货物包装材料的法令要求；喷涂钢托盘适用于重载上货架之用，托盘表面根据需要制作成平板状、波纹状及间隔形式，满足不同的使用要求。