因此研究广义半无限规划问题具有重要的实际意义。
Therefore, it is very significant to study the generalized semi-infinite programming.
研究半局部凸函数在多目标半无限规划下的对偶性。
The duality conditions for multiobjective semi-infinite programming with semilocally convex functions are given.
提出更准确地描述准时化生产计划问题的非线性半无限规划模型。
To closely describe the just - in - time production planning problems a nonlinear semi - infinite programming model is proposed.
本文主要研究了非紧致集上的极大值函数和带不等式约束的广义半无限规划。
This dissertation is devoted to the study of sup-type function on non-compact set and the first-order optimality conditions for generalized semi-infinite programming with inequality constraints.
算法用于求解用半无限规划模型描述的新产品投入计划问题,获得了满意的结果。
It has been applied into the new product introduction problem presented by a semi-infinite programming model. The satisfactory results have been achieved.
通过精心规划,云环境可创建计算资源无限供应的外观。
With careful planning, a cloud environment can create the appearance of an endless supply of computing resources.
荷兰高柏伙伴公司通过“多维景观规划”的设计哲学,在有限的土地上创造出无限的景观。
Kuiper Compagnons has created unlimited landscape on limited land by introducing the design philosophy of "multi-dimensional landscape planning".
本文对半无限凸规划提出一个用方向导数表述的对偶问题,其对偶间隙为零。
The paper offers a dual problem for the semi-infinite convex programming by using the directional derivative with zero dual gap.
本文给出了半无限二次规划和它的对偶规划之间没有间隙的条件。
The conditions under which there is no duality gap between the semi-infinite quadratic programming and its dual programming are given.
虽然一个人可以用无数种方式来回答这个毫无限制的问题,但回答这个问题以及面试中的其他问题的关键之处,是你的答案应该对你的职业规划有所帮助。
Though one could answer this open-ended question in a myriad of ways, the key to answering this question or any other interview question is to offer a response that supports your career objective.
资源的有限性与城市防灾工程项目需求的无限性,是城市防灾规划管理中的一大难题。
The limited resources and limitless demand in engineering project of city disaster prevention is a great challenge in planning management of city disaster prevention.
本文给出了一种求解无限制板材下料问题的动态规划解法,对该算法的计算复杂度进行了分析。
In this paper, a new dynamic programming algorithm for unconstrained 2D stuck cutting problem is presented.
本文给出了一种求解无限制板材下料问题的动态规划解法,对该算法的计算复杂度进行了分析。
In this paper, a new dynamic programming algorithm for unconstrained 2D stuck cutting problem is presented.
应用推荐