Computational examples show that the modified subgradient optimization algorithm for Lagrangean relaxation can reduce the iterative steps obviously, and is proved to be efficient.
算法实例表明，改进后的拉格朗日松弛算法迭代步数显著减少，证明算法是有效的。
The notions of subgradient, subdifferential, differential with respect to convex fuzzy mappings are investigated, which provides the basis of the theory of fuzzy extremum problems.
最后对凸模糊映射的次梯度、次微分和微分等概念进行了研究，为模糊极值理论打下了基础。
A projection subgradient algorithm for the Lagrangian dual problem of the relaxed quadratic problem is employed to general lower bounds of the optimal value for the original problem.
采用椭球剖分策略剖分可行域为小的椭球，用投影次梯度算法解松弛二次规划问题的拉格朗日对偶问题，从而获得原问题的一个下界。
This paper focuses on the modeling of the resources location of medical rescue. At first, the traditional Lagrangean relaxation algorithm is improved by using subgradient optimization algorithm.
以医疗急救资源的配置问题为建模核心，运用次梯度最优算法对传统的拉格朗日松弛算法进行了改进。
The subgradient set, optimization and procedure are constructed. In particular, a new deletion rule is suggested to reduce the amount of information to be stored during the computation procedure.
文中给出了最优性条件、次梯度集合的构造方法及算法的迭代程序，提出了新的删除定理，可以减少迭代过程所储存的次梯度的信息量。
The subgradient set, optimization and procedure are constructed. In particular, a new deletion rule is suggested to reduce the amount of information to be stored during the computation procedure.
文中给出了最优性条件、次梯度集合的构造方法及算法的迭代程序，提出了新的删除定理，可以减少迭代过程所储存的次梯度的信息量。
应用推荐