证明了用这种方法求出的最优解是有效解。
本文讨论多目标凸参数规划的真有效解稳定性。
In this paper, the stability of proper efficient solution of multi-objective convex parametric programming is discussed.
讨论了向量极值问题KT真有效解集的连通性问题。
In this paper, the connectedness of KTproper efficient solution set for vector minimization is discussed.
文中引进了极小扰动约束规划的极小扰动有效解概念。
This paper introduces the concept of minimal perturbation efficient solution in minimal perturbation constraints programming.
本文研究向量优化问题在严有效解意义下的最优性条件。
Optimality conditions for vector optimization problem to attain strictly efficient solutions are considered in the paper.
把拟凹推广到锥拟凹，证明了锥弱有效解集仍是连通的。
The quasiconcave was extended to the cone-quasiconcave, and the cone weak efficient solution set was still connected.
并给出集值优化问题的超有效解在广义梯度下的最优条件。
The optimality conditions of (super)-efficient solution of set-valued optimization problems are presented in the sense of generalized gradient.
作为其应用，给出了向量优化中关于精确有效解的一个结果。
As their application, we give a result of sharp efficient solution in vector optimization.
工厂模式是把客户端模块与服务端模块有效解耦的模式之一。
Factory pattern is one of the effective patterns which decouple client and server.
原问题的有效解和核心有效解的关系可以用粗糙近似来刻画。
The relationship between efficient solution and core efficient solution is described by rough approximation.
给出了求可能有效解的方法，并对区间数线性规划进行拓展。
An approach to obtaining possible effective solution is proposed and an extension of interval number linear programming is given.
目的研究锥扰动集值映射向量优化问题锥有效解的锥次可微性。
Aim to study the cone subdifferential of the cone efficient solution sets for set valued vector optimization problem with perturbed order.
解决所有点对之间最快路问题的关键是产生有效解的等价集合。
The key idea to solve all-pairs quickest path problem is to generate an equivalent set of efficient solutions.
通过此解答可以解决旋转薄壳自由振动一致有效解的求解问题。
The uniformly valid solutions for free vibration of revolution shells can be worked out through these answers.
本文在局部凸空间中对集值映射最优化问题引入超有效解的概念。
In this paper, we introduce a concept of super efficient solution of the optimization problem for a set-valued mapping.
此外，提出了这种具有概率约束多目标随机规划问题的一种有效解模型。
In addition, the efficiency solution scheme of this problem is given, after the multiple objective stochastic programming with probabilistic constrained is discussed.
文中介绍了严有效解的概念，研究了锥—连续拟凸映射的严有效解的连通性。
In this paper a new concept, the strictly efficient solution, is introduced, the Cone-continuous convex map and the connectedness of the set of strictly efficient solution, are studied further.
利用较多锥的内部和闭包，引进多目标规划问题的严格强较多有效解等概念。
On the basis of them the authors have defined (s, k)-major efficient solution and (s, k)-major optimal solution of multiobjective programming problem.
在群体多目标决策方面，主要成果是：得到一般模型联合有效解类的基本性质；
With regard to group multicriteria decision making, we have the following results: we have obtained the basic properties of the class of joint efficient solutions for general models;
将弱有效解的判断问题转化为判断一线性方程组是否存在非负、非零解的问题。
The problem about how to determine the weak efficient solution of convex multiobjective programming is turned into a problem judge whether an equation has non-negative non-zero solution.
在多目标规划的弱较多有效解的基础上，引进了它的次 弱较多有效解概念。
Sub-weakly major efficient solution of multiobjective programming is introduced on the basis of weakly major efficient solution.
系统地讨论了集函数多目标分式规划的弱有效解、有效解和真有效解的基本定理。
Systematically discusses the fundamental theorems of weak efficient solution, efficient solution and properly efficient solution for multiobjective fractional programming problems with set functions.
它既可以克服模型工作点变化所带来的非线性问题，同时又可以保证控制回路间的有效解耦。
It can overcome the nonlinear characteristics aroused by the change of model working point, and can also guarantee the decouple performance between the control loops.
为求得一类多目标系统在有效解集上均匀分布的多个具有代表性的满意解，提出一种改进的GA算法。
An improved GA was presented for finding several representative and satisfactory solutions of a category of multi-objective systems uniformly distributed on the set of non-trivial solutions.
引进了求解一类多目标优化问题弱有效解的优界数列方法，给出了这种优界数列的构造法及相应的算法。
An optimal boundary sequence method is introduced to find the weak efficient solution to a multi objective optimization problem.
本文给出多目标规划有效解适应鞍点准则的一个新的判别法，它不使用凸性的几何术语及凸分析中的概念。
This paper offers a new characterization method for an efficient solution of multiobjective programming satisfying the saddle point criteria.
然后利用正切锥方向导数定义一类正切锥F凸函数类，并给出了（VP）正切锥真有效解的充分性条件；
Then, we define a class of tangent cone F convexity in terms of the tangent cone directional derivative, and prove the sufficient optimality conditions for (VP).
在此基础上，得到了向量目标函数既是似凸又是拟凸的多目标最优化问题的G-恰当有效解集是连通的结论。
On the conditions that vector objective function is like-convex and quasi-convex, we obtain the connectedness of G-proper efficient solution set of the multiobjective optimization problem.
计算机仿真结果表明，该方法可以获得最优有效解，并且解的质量明显提高，对求解中大规模的TSP比较有效。
Computer simulations show that optimal solution can be obtained using this method and the tour quality is enhanced. This method is valid for solving medium or large scale TSP.
计算机仿真结果表明，该方法可以获得最优有效解，并且解的质量明显提高，对求解中大规模的TSP比较有效。
Computer simulations show that optimal solution can be obtained using this method and the tour quality is enhanced. This method is valid for solving medium or large scale TSP.
应用推荐