可行集

证明了当可行集X为紧凸集，目标函数f在X上锥连续锥拟凹时，其弱有效解集是连通的，在一定的意义下，改进了文献[1]中的结果。

It is show that the set of weakly efficient solutions is connected when the feasible set X is compact and the objective function f is cone - continuous and cone - quasiconcave .

向量F-互补问题，广义向量变分不等式以及可行集的最小元问题。

Vector F-complementarity problem , general vector variational inequality , and least element problem of feasible set .

在对合资企业一定的稳定性预期下，跨国公司的技术转移可行集由IJV的技术转移受益系数、合资伙伴的技术转移受益系数共同决定。

Under a stable expectation of the IJV , the feasibility aggregation of technology transmission are decided by the technology transmission benefit coefficient of IJV and its partner .

供应链契约可行集的建立与分析

Analysis construction of contract feasible set in supply chain

第二，通过对资源禀赋的探讨，可以寻找到反锁定安排的产业可行集；

Secondly , a industrial feasible set can be defined through the study on resource endowment .

在每一步，投影法只需要做一些到可行集的投影及一些函数的计算。

At each step , the projection algorithm is only to do the pro-jection into the feasible set and some function calculations .

寻求离散变量结构优化设计0－1规划可行集的差商向量法

Difference quotient algorithm for finding the feasible set of ( 0 , 1 ) programming of optimum design of structures with discrete variables

该方法基于可行集策略把改进的模拟退火方法与确定的局部算法方法相结合。

The new algorithm , based on a feasible set strategy , uses an improved simulated annealing algorithm and a deterministic local algorithm .

有限次迭代后，迭代点进入可行集且主方向是一可行下降方向。

After finite iterations , the iteration point gets into the feasible set and the master direction is a feasible direction of descent .

一方面，以提高参数可行集的近似描述效果为目的，对原有的基于最小二乘支持向量机的集员辨识算法进行了改进。

On one hand , the original set membership identification algorithm by least squares support vector machines is improved for better characterization of the feasible parameter sets .

在原始规划可行集上引入了正则的概念，并在此正则条件下，研究了更一般的概率约束规划问题的稳定性。

The concept of regularity of feasible set is presented , under the regularity condition , the stability of more general probabilistic constrained programs problems is studied .

此决策函数对参数空间中的点按是否属于可行集进行分类。

The points in the parameter space can be divided into two classes according to whether they are in the feasible parameter set or not by decision functions .

同时，有创意的引入帕累托最优概念模型进行改进，还将投资学中的马柯维茨关于可行集和有效集的概念与目标函数进行了类比分析。

We develop the model by drawing into the concept of " Pareto optimality " and use the concepts of feasible set and validation set to analyze the target function .

在一般可行集下，结合非光滑方程组解法及投影映射的性质，讨论了法方程求解变分不等式问题的算法构成。

Under general feasible set , in consideration of the algorithms for nonsmooth equations and the properties of projection map , the algorithms using the normal equation to solve are discussed .

定义了使模型具有经济意义的可行集，通过理论分析和数值仿真相结合的方法得到可行集的边界。

The feasible set is defined in which the variables economic senses exist and boundaries of the feasible set can be obtained by using combined methods of theoretical analysis and numerical .

它的重要几何性质是：可行集由约束域的若干面组成，最优解具有顶点可达性。

The important property is that the feasible region is composed of several surfaces of the constraint region , and the optimal solution occurs at an extreme point of the constraint region .

该方法中，离散事件仿真作为隐式模型出现，遗传算法根据离散事件仿真的结果对调度解可行集进行搜索，最后求得优化的调度方案。

The input of this model is the charging order of the annealing plans being annealed , which can be coded in natural number and expressed as the gene in genetic algorithm conveniently .

与已有的组合同伦内点法相比，去掉了初始点为可行集内点的限制条件。

In contrast to the existed combined homotopy interior point methods , the start point needs not to be an interior point of the feasible set , so the new method is more convenient to use .

本文对于下层为线性多目标规划的二层规划问题，在约束域非空有界的条件下证明了可行集的弱拟凸性、连通性，为算法设计提供了理论依据。

For bilevel programming problem with its lower-problem being linear multi-objective programming , it is proved that the feasible set is weakly quasi-convex and connected under the assumption that the constrained region is bounded and nonempty .

该方法主旨是将整数规划问题的离散的可行集填充成一个连续的单纯形，这样原整数规划问题就化为该单纯形上的一个新的线性规划问题。

The main idea of the solution is that a discrete set consists of all the feasible solutions of ILP is stuffed into a continuous simplex , consequently the ILP is transformed into a new Linear Programming ( LP ) .

本文引入几类向量F-互补问题，并在一定条件下给出了向量F-互补问题，广义向量变分不等式以及可行集的最小元问题之间的相互关系。

Several classes of vector F-complementarity problems are introduced and studied in this paper . The relations of the vector F-complementarity problems , general vector variational inequalities , and least element problems of feasible set are given under certain conditions .

为使供应链成员之间制订的契约具有较强的实用性，需要把契约参数扩大为一个区间，由此提出了供应链契约可行集的概念，阐述了契约可行集的定义及其性质。

To satisfy practical requirements of contract making among supply chain members , the concept of Contract Feasible Set ( CFS ), which extended the contract parameters to an interval , was proposed . Definition and properties of CFS were discussed .

特别地，在可行集非紧的条件下，向量均衡问题的有效解集（弱有效解集）往往是空集，但近似解集在很弱的条件下一般都是非空的。

In particular , efficient solution set ( or weak efficient solution set ) may often be the empty set when the feasible set is noncompact . But the set of approximate solution in very weak conditions can be not empty .

通过对模型的同胚变换可得到：如果对角线上的混沌吸引子在垂直于对角线方向上局部稳定，那么它在可行集的范围内也全局稳定。

Based on the homeomorphous transformation for the model , it can be concluded that if the chaotic attractor for the diagonal is stable for the transverse small perturbation in neighborhood , it should be globally stable in the whole feasible set .

SOC系统综合的主要任务之一就是针对具体的应用在可能的设计空间中找到一组满足设计约束的IP可行配置集，其本质是求多目标优化问题的最优解。

One main task of the SOC system-level synthesis is design space exploration . The essential of the task is finding the optimal set of solutions to a multiobjective optimization problem .

在agent模型中，agent的心智状态由状态信念集、效应规则集、可行规则集、策略规则集和意向集组成。

In this paper , an agent model is constructed which has the advantages of BDI model and the situation calculus . In the agent model , the mental states of an agent are comprised of state beliefs , effect rules , feasibility rules , strategy rules and intentions .

为了求解决策模型，给出了材料预选择的可行解集搜索算法PSSA，并进一步采用TOPSIS方法对可行解集求解最优解。

The possible solutions search algorithm ( PSSA ) is used to pre-select the materials to obtain the feasible solutions , and TOPSIS method is used to acquire the optimal solution .

根据最优化理论建立了内弹道多指标决策模型，制定了基于经典内弹道模型的可行方案集和指标集，并采用TOPSIS算法对可行方案进行综合优化和排序。

Based on the optimization theory , the interior ballistic multiple attribute decision-making model is established . Feasible program set and index set for a certain large caliber gun is made based on classical internal ballistic model . Synthetic optimization and sequence is done for the program with TOPSIS algorithm .

一类线性矩阵不等式可行解集的构造

Construct on the Feasible Solution Set to a Class of Linear Matrix Inequality

通过引入鲁棒不变集，构造了关于估计状态的终端约束集和可行不变集，从而实现了输出反馈双模控制，证明了闭环系统的稳定性。

Robust invariant set is introduced to obtain the terminal constraint set and feasible invariant set for the estimated state .