本文对随机规划经验逼近最优解集的几乎处处上半收敛性进行了研究。
This paper discussed almost everywhere upper semiconvergence of optimal solution set of empirical approximations for stochastic programs.
该操作不仅起到了维持非劣最优解集均匀性的作用，而且增强了算法的搜索功能。
The operation not only helps to maintain uniformity of the Pareto optimal solution set, but enhances the algorithm's searching ability.
研究了最优解集过程的平稳性、马氏性以及最优值过程的鞅性和最优解集过程的集值勒性。
The stationary property, Markoy Property and martingale property of the optimal solution sets process are discussed.
在一定的条件下，得到了概率约束规划逼近最优解集的稳定性和最优值的连续性，从而对近似求解这类问题提供了某种理论依据。
The stability of approximate optimal solutions sets and the continuity of optimal values of probabilistic constrained programs are obtained under some conditions.
在此基础上，得到了向量目标函数既是似凸又是拟凸的多目标最优化问题的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.
本文在局部凸空间中对集值映射最优化问题引入超有效解的概念。
In this paper, we introduce a concept of super efficient solution of the optimization problem for a set-valued mapping.
本文介绍了求解凸集上凹函数最优解的一种分支定界方法。
A branch and bound methods is proposed for minimizing concave function over a convex.
本文证明了最优对策解集的一些性质，然后给出矩阵对策公平度的概念并证明了它的一些有趣的性质。
And we also give the concept of equitable degree of a matrix game and prove some interesting results about it.
并给出集值优化问题的超有效解在广义梯度下的最优条件。
The optimality conditions of (super)-efficient solution of set-valued optimization problems are presented in the sense of generalized gradient.
在一般的假设条件下 ，我们应用性能势的基本性质直接建立了无限时间水平平均代价模型的最优性方程 ，并且证明了在紧致集上最优解的存在性 。
Under a general assumption, we establish directly the optimality equation for infinite time horizon average cost model and prove the existence of optimal solution in a compact action set by using p.
通过对各种均衡解的效率的比较，得到了所谓的可行的帕累托最优的价格策略集，即合同曲线。
After detailed comparisons and discussions, the so-called feasible Darete efficient set of pricing schemes contract curve is obtained.
为了获得简明的规则集，通常希望能找出最小的属性约简集，而求解最小约简是NP难问题，解决此类难题通常采用启发式算法以求得近似最优解。
The minimum attributes reduction set is expected to acquire the brief regulated set. This is taken as NP-hard Problem, which can be figured out through the heuristic algorithm.
最后，本文对多期连续的TSF模型作了较深入的研究，给出了基于亏损约束下的有效集和最优解的存在条件。
At the end, the paper studies the continuous Multi-period TSF Model more deeply, and the efficient frontier and the optimal solution under the constraint of loss are given.
集值优化问题的最优性条件与解集的结构理论在集值优化理论中占有重要的地位。
Under the nearly cone-subconvexlike set-valued maps, relations of strong efficient solutions and Kuhn-Tucker saddle point of set-valued optimization problem are dicussed.
集值优化问题的最优性条件与解集的结构理论在集值优化理论中占有重要的地位。
Under the nearly cone-subconvexlike set-valued maps, relations of strong efficient solutions and Kuhn-Tucker saddle point of set-valued optimization problem are dicussed.
应用推荐