feasible constraints

feasible constraints的基本解释

-

可行约束

与feasible constraints相关的网络例句 [注：此内容来源于网络，仅供参考]

In the chapter of improving banking supervision, we analyze the games with complete and incomplete information between supervisors and banks, and their strategies therein during the operating and market exiting stages. We come to the conclusion that in the long run, the supervision of operational risks should progress from direct surveillance to indirect surveillance. In the chapter of incentives and constraints, we first discuss the reform of personnel system (non- monetary rewards and punishments) and salary system in the SOBs, demonstrated with an optimal model. Then we show that it is feasible for senior executives of SOBs to bear a part of operational risk loss through a model of guarantee and compensation. It is a bold attempt in current situation when domestic liability insurance market is still not mature.

银行业监管一章，我们通过设计一组监管部门与国有商业银行的完全信息和不完全信息博弈，分析了它们在运营阶段和市场退出阶段的政策选择，并提出了对操作风险的监管在长期要实现从"直接监管"到"间接监管"的转变；激励约束一章，我们首先讨论了国有商业银行的人事制度与薪酬制度改革，并通过一个最优化模型给予说明，然后设计了一个操作风险损失保证金与赔偿金模型来说明让国有商业银行高级管理人员负担一部分操作风险损失的可行性。

Based on the method of multi-objective fuzzy optimization and the overhead traveling crane design, a mathematical model of fuzzy optimization for main box beam section is established. A fuzzy goal anthology is constructed. The fuzziness of multi-objective function and constraints is defined. The transformation of the fuzzy constraints set to normal constraints set in real number domain is realized by applying optimal level cut set method. The optimal solution and optimal constraint value of sub-objective function in the feasible field are found using the genetic algorithms.

应用多目标模糊优化方法，以工程设计中桥式起重机箱形主梁设计为实例，建立了桥式起重机箱形主梁多目标模糊优化设计的数学模型，构造了模糊目标集，确定了多目标函数的模糊性和约束的模糊性，并应用最优水平截集法实现了模糊约束到实数论域上的集合转换，从而用遗传算法寻求到子目标函数在可行域空间的最优解和约束最优值。

There exits several MDO algorithms. But they are in our opinion either nonefficient or complicated. So we devised an algorithm called Subspace Approximation Optimization . In the SAO algorithm, the whole system is decomposed into one system-level optimization and several disciplinary optimizations so that a large and complicated problem can be divided into several easy-solving sub-problems. The coupling relationships and the coordination among disciplines are presented by equality constraints and these equality constraints are assigned to relevant disciplines. The optimums of design variables in system level optimization are transferred to discipline level optimization. The optimums of design variables in discipline level correspond to the point that is the nearest to the optimums of design variables in system level. If the optimums of design variables in system level are out of feasible region of discipline 1eve1, linear constraints can be built in the system level optimization using the design variable optimums obtained by the discipline level optimization. The system level optimization would improve the design of the whole system with these linear constraints.

目前，国内外已经发展出了多种飞机多学科设计优化算法，本文的重点是针对协同优化算法的不足，提出了子空间近似优化算法(Subspace ApproximatingOptimization，SAO)，SAO算法中，整个系统的优化问题被分解成一个系统级优化和若干学科级优化，而各个学科之间的耦合与权衡关系则被当作等式约束，这些等式约束将被分配到各个学科级优化中去，系统级优化的任务是寻找整个系统的最优解，而学科级优化的目标函数是以系统级优化分配下来的设计点为圆心的超球半径的平方，因此，如果系统级优化分配下来的设计点在学科级优化可行域内，则学科级优化目标函数为0，反之，则学科级优化的最优点是系统级优化当前设计点距离可行域最近的点。

与feasible constraints相关的网络解释 [注：此内容来源于网络，仅供参考]

feasible direction：可行方向;容许方向

可行约束;可行制限 feasible constraints | 可行方向;容许方向 feasible direction | 可行区域 feasible region