可行约束

The properties of the basic feasible solution of a linear programming problem are studied.

对线性规划问题基可行解的性质进行了研究，给出了一种求解线性规划问题初始基可行解的算法，该算法的时间复杂度是约束条件个数的线性函

On the basis of the actuality of the power industry, the paper lists the implement ation condition of incentive compatibility constraint and participation constraint.

针对电力行业现状，本文分析了参与约束和激励相容约束的实现条件，在对交叉补贴、普遍服务基金和政策性补助等几种电力普遍服务实现机制进行讨论的基础上，提出建立电力普遍服务基金是相对可行的、最有效的解决方案。

Parametric evaluation function can condense the complicated multi-objective and multi-constrait problem into a single-objective unconstrained problem, then solved with conjugate gradient method.The parametric evaluation function method decreases the optimization difficulty,and makes the solution away from the boundary of feasible region during the optimization process,which makes all the objectives optimized simultaneously.

参数评价函数把复杂的多目标多约束优化问题转化为单目标无约束问题，然后用共轭梯度法进行求解，不但降低了求解难度，而且使得在优化过程中其解远离可行域的边界，保证了对多目标中所有目标同时进行优化。

Based on constraint satisfaction,an entirely feasible scheduling is obtained by constraint propogation technology and heuristic repair method and is regarded as initial solution for tabu search algorithm.Current solution is optimized by neighborhood transformation on a critical path.The final optimizal solution is improved by adopting a global neighborhood swapping strategy.

该算法基于约束满足思想，通过约束传播技术和启发式修复算法，得到可行调度作为禁忌搜索算法的初始解；再进行关键路径上的邻域变换，优化当前解；并采用一种全局邻域交换策略，扩大搜索空间，改善优化结果。

An infeasible sequential system of linear equations filter algorithm is presented to solve this type of problem.

针对这种具有特定的等式约束优化问题，提出了一种求解不等式约束优化问题的不可行序列线性规划滤子方法。

Utilizing the information of product s assembly region and carrying out decomposition upon the product according to cut-set method of graph theory, this method establishes the constraint relation of geometrical preference,.

在分析总结以往学者对装配顺序规划研究的基础上，综合拆卸法和优先约束法的特点，探讨了一种新的装配顺序分析方法，该方法利用产品的装配域信息，根据图论的割集法对产品进行拆分，建立几何优先约束关系，然后通过人机交互的方式建立工艺优先约束关系，最终得到可行的产品装配顺序。

In the third chapter, we concerned PVT algorithms for bound constrained optimization problem and proposed two feasible PVT algorithms.

第三章，我们对含边界约束的PVT算法进行了研究，给出了求解边界约束优化问题的PVT可行算法。

By this comparition,the advantage which use double structure encode to solve knapsack problem is proved. Genetic Algorithm ; Knapsack problem ; dual-structure encode

解决背包问题的关键在于约束条件的处理，目前一般采用惩罚函数的方式处理约束条件，这种方法当问题规模较大时，尽管可行，但搜索效率很低，甚至有时得到的结果比一般的启发式算法还

Facing the fact that the inefficient china securities market, the article analyzes carefully the reason for low contract efficiency from the following aspects such as property rights, insufficient information regulation and the structure of regulation mechanism. What抯 more, the article points out reregulation is a possible way to normalization development of china security market after analyzing the disadvantages of strengthening regulation and deregulation. At length, the thesis paper will discuss the design of reregulation mechanism from the principles of incentive and constraint regulation institution and punishment mechanism.

面对中国证券市场管制低效的局面，本文从产权、信息不足约束以及管制机构治理结构等方面详细剖析了造成管制低效的原因，进而在分析加强管制和放松管制等论点的不足之后，指出再管制是通向中国证券市场规范化发展的可行之路，而且从管制机构激励约束、惩罚原则等方面讨论了再管制实施机制的设计问题。

On this basis, kinematics simulation of the model was used by Adams. Meanwhile,this paper also introduced the way of constraint of Differential gear and Shortcomings in the course of Adams simulation, and pr oposed a new and feasible way of establishment of gear constraint.

建立了基于UG对无级传动变速器的三维模型，在此基础上运用Adams对模型进行运动学仿真，同时介绍了在Adams仿真过程中差动轮系约束的建立方法以及还存在的缺点，并且提出了建立齿轮约束的新的可行的方法。

The absorption and distribution of chromium were studied in ryeusing nutrient culture technique and pot experiment.

采用不同浓度K2CrO4(0，0.4，0.8和1.2 mmol/L)的Hoagland营养液处理黑麦幼苗，测定铬在黑麦体内的亚细胞分布、铬化学形态及不同部位的积累。

By analyzing theory foundation of mathematical morphology in the digital image processing, researching morphology arithmetic of the binary Image, discussing two basic forms for the least structure element: dilation and erosion.

通过分析数学形态学在图像中的理论基础，研究二值图像的形态分析算法，探讨最小结构元素的两种基本形态：膨胀和腐蚀；分析了数学形态学复杂算法的基本原理，把数学形态学的部分并行处理理念引入到家实际应用中。