A structural global optimization approach by usingpolar points in feasible regions as initial starting points;
以可行域极[点]为初始迭代点求结构优化全局最优解
In this paper,the analysis of location,location selection and location superiority is based on the analysis of location capability, which is about the attraction of the polar point to the object of location capability, such as investment, persons with ability and so on.
区位、区位选择和区位优势分析的基础是该文中提出的区位能,即分析各极[点]因其区位条件而对区位能客体 的吸引力。
A global optimal method based on effective extreme point for bilevel linear programming;
基于有效极[点]的双层线性规划的全局优化方法
Based on the result that a global optimal solution to linear bilevel programming occurs at an extreme point of its constraint region, we discuss the structural feature of its feasible region and propose a global convergent algorithm which make use of cutting plane technique.
利用线性双层规划的全局最优解可在其约束域的极[点]上达到这一性质,通过对问题可行解集合的结构进行探讨,引进一种割平面技术,提出了一个求解线性双层规划的全局收敛算法,并通过一个算例说明了算法的求解过程。
The discriminance methods and expression of generalized alternative optimum solutions of linear programming is given by proving that the equivalent of optimum extreme point and extreme point of optimum solution sets of linear programming and applying the theorem of convex polyhedron.
通过证明线性规划最优解集的极[点]与线性规划最优极[点]的等价性,利用凸多面体的表达定理,给出了广泛意义下线性规划无穷多最优解的判别方法及表达式。
Analysis of the Invariability of Target Electromagnetic Scattering Poles;
目标电磁散射极[点]的不变性特征分析
On dynamic output control with constraints on H_∞, pole placement and covariance;
满足H_∞,区域极[点]和方差指标约束的动态输出反馈控制研究
On the Spectrum of the Laplacian on a Riemannian Manifold with a Pole;
带有极[点]的黎曼流形上Laplacian的本质谱
An Equivalent Circuit Method for Calculating the Poles of a Conducting Sphere;
求解导体球极[点]的等效电路法
On a resolution about meromorphic functionsof two order poles;
二级极[点]亚纯函数的分解
Methods The method for separating the merged peaks in ensemble averaged EP signals by analyzing and correcting the poles of EPs was reported.
目的 分解由于总体累加平均而引起融合的诱发电位峰 ;方法 通过分析并修正与脑电诱发电位 (EP)信号相关的极[点]来进行分解 ;结果与结论 有效地提高了EP信号潜伏期的分辨率 ,达到了分解融合峰的目的 ,从而有助于改善利用EP信号进行临床诊断的可靠性和准确
Assuming knowledge of extreme points,we develop bounds for associated convex combinations and improve bounds on the integer programming problem s objective function and variables.
应用已有的极[点]理论，优化相伴凸组合的界并改进整数规划问题的目标函数及变量的界。
First,the definition domain of leader s variables is divided into several sub-regions according to the extreme points of the feasible region of the follower s dual problem such that each divided sub-region corresponds to an extreme point.
首先利用下层对偶问题可行域的极[点]对上层变量的取值域进行划分,使得每一个划分区域对应一个极[点]。
Based on the fact that the follower’s problem can attain its optimum at an extreme point, an algorithm for getting all extreme points of the feasible region of the follower’s problem is integrated with a genetic algorithm.
利用下层目标的最优值能在可行域极[点]上达到的性质,将求极[点]的方法引入遗传算法,提出了一种混合遗传算法。