Optimality Conditions for Set-Valued Vector Minimization Problem

For set valued vector minimization problem with inequality constraint, a sufficient optimality condition theorem and a necessary Fritz John type optimality condition theorem is derived in terms of the generalized contingent epiderivative. Finally,a Kuhn Tucker necessary type optimality condition theorem for the set valued vector minimization problem is presented in terms of contingent epiderivative.     

Optimality Conditions for Vector Optimization of Set-valued Maps

Kuhn Tucker optimality conditions and Lagrange multipliers for vector optimization problems with subconvexlike set valued maps wereestablished by Li zemin. Firstly, the concept of generalized subconvexlikeness for set valued maps is introduced in this paper. Then, a theorem of the alternative for generalized subconvexlike set valued maps in real linear spaces is established. Finally, the optimality conditions for vector optimization problems with set valued maps with equality and inequality constraints are obtained with it.     

Optimality Conditions for Nonsmooth Extremum Problems in Topological Vector Spaces

Some new concepts of coneD_s convexity,coneD-s quasiconvexity,cone D-s pseudoconvexity,s right derivative of vector value mapping are proposed;and their related properties are discussed;the optimality necessary conditions and sufficient conditions for constrained extremum problem(VP)involving in cone D-s convex mapping are extablished;the relation between local optimal solution and global optimal solution;as well as the relation between weakly efficient solution and efficient solution for (VP) are derived;the corresponding results generalize the related results of classic convex programming.     

The Optimality Conditions for Cone-Preinvex Set-Valued Functions

This paper deals with the minimization problems of cone preinvex set valued functions in the topological vector space .The optimality conditions for vector optimization of cone preinvex set valued functions are obtained.     

A NEW APPROACH OF OPTIMIZATION

In this paper, a necessary optimality condition of problems with equality constraints is investigated by the implicit function theorem in n-dimensional Euclidean space. A new approach solving these problems is obtained. The number of dimensions of corresponding system of equations is less than the classic Lagrangian multiplier method.     

The Convergence of a 2-Block AOR Method for Large-Scaled Least-Square Problems

A necessary and sufficient condition and some sufficient conditions concerning the convergence of a 2-block AOR method for large-scaled least-square problems are given. It is shown that, by appropriately selecting parameters, the 2-block AOR method is always convergent and the theorem in [3] is only a corollary of this paper.     

Dynamic Simulation on the Hoisting Mechanism of a Crane

Considering the difficulties of mathematical analysis and the complex computer programming of numerical methods in solving dynamical problems of the multi-body dynamic system for the hoisting mechanism of a crane, in this paper, a multi-mass-multi-freedom model is set up and the simulation system of the model is built up applying MATLAB/SIMULINK toolbox. The differential equations of the model is solved with adaptive-step fourth-order Runge-Kutta method. In the study, the typical work conditions of the hoisting mechanism, such as start rise from ground, start rise/down in air, brake conditions, were simulated. The dynamic performance of the hoisting mechanism is studied and the results obtained are valuable to practice. This study improves the modeling accuracy of the hoisting mechanism and the results of precious theoretical analysis and numerical computation conclusions. The movement of every discrete body of the system can be modeled applying the methods suggested by this study and more consistent results between model and actual hoisting mechanism can be achieved.     

Approximation of the necessary and sufficient conditions for stability of Takagi Sugeno fuzzy control systems

An extensive analysis on the existing results for the stability of Takagi Sugeno fuzzy control is given. For the Lyapunov functions, the common quadratic Lyapunov functions, piecewise quadratic Lyapunov functions, fuzzy Lyapunov functions, nonquadratic Lyapunov functions and homogenously polynomially parameterized Lyapunov functions are considered. For the control laws, the parallel distributed compensation laws, non parallel distributed compensation laws and homogenously polynomially parameterized control laws are considered. Based on the analysis, by applying the Polya's theorem and the techniques for homogenous polynomials, the approaches for approximating the necessary and sufficient conditions for stability of T S fuzzy control are given.     

OPTIMALITY CONDITIONS IN GENERALIZED VECTOR OPTIMIZATION

This paper studies the constrained and unconstrained optimization.Their objec-tive functions are set-valued map.By using tangent derivative,an analogue of K-T necessary andsufficient optimality conditions is proved.     

Descending Dimension Algorithmfor Quadratic Programming Problem

This paper deals with the linear equations algorithm for quadratic programming problems with equality constraints.In this paper the optimality conditions were used for programming problem with equality constraints and then a linear equation was established. Finally the solution of these leads to optimal solution of quadratic programming problems.     

SCALAR LOCALLY UNIQUE SOLUTIONS OF VECTOR VARIATIONAL INEQUALITY

This paper first deds with the relations of solutions of vector variational inequality and vector optimization problem. Then, K-T Necessary and sufficient conditions are proved. Finally, scalar locally unique solution is introduced. Under certain conditions,the exitence of scalar locally unique solution of vector variational inequality is proved.     

A Class of Planar 5 - Body Central Configurations

Newtonian n-body problem is an old, complicated problem. It is very significant to study it. Even about three problem, the completed solutions have not obtained so far. It is one hottest point studied in n-body problem. Based on some hypothesis of symmetric conditions, some necessary and sufficient conditions have been obtained with the purely algebra method. The classification of planar 5 - body central configurations is discussed , in which three class planar 5 -body central configurations are obtained.     

The Similar dual of a Subnormal Operator

The problems of similar dual of subuormal operators are discussed.The symmetry of similar dual of the pure subnormal operator are proved and necessary and sufficient conditions that the similar pure subnonmal operatorha similar minimal normal extention are given and meanwhile the subnormal weighted shift of operators also discussed.     

Product family configuration-oriented constraint network model and configuration

Concepts of requirement elements and configuration elements and the model of customer requirements family are proposed for the configuration problem of product family. The constraint relationships are taken into account to establish a feature attribute mapping-based constraint network,which is between configuration elements,as well as requirement element and configuration element. The scale of the configuration problem solving has been reduced through the ordinal constraint diffusion that according to the weight of requirement elements,and also through the range reduction of configuration element related to requirement element by pretreatment. The set of rapid configuration results is obtained by constraint solving for undetermined configuration element,applied the non-binary uniformity backtracking algorithm. Ultimately the feasibility of the proposed approach is validated by means of an example of a chassis configuration design.     

Logistics Scheduling Modle of Region Distribution Center

In order to solve the scheduling problem of frequent distribution of a little goods in one batch between regions in logistics system, We use time slices to manage orders, thus disassembling, combining orders and optimizing the planning to cut the cost. A product-scheduling model in region distribution is presented based on the retailing chain system. A method is presented which spends little cost on logistics plans under constraint conditions (time constraint conditions and space constraint conditions) by using combination and optimizing based on the three layers framework of distribution center, region distribution center and retail shop. The simulation result shows that the model and algorithm is indeed effective to solve the supply problems in multicommodity or multi-shop.     

根际增氧模式的水稻形态、生理及产量响应特征

地表积水是导致水稻地下部分(根系)缺氧胁迫的主要原因。根际缺氧时,提高水稻根系通气(增加孔隙度)可能会减少营养物质的吸收面积,因此,根系必需在形态和代谢上进行一定的调节,而这种调节又会影响作物生长和根际状况。控制灌水(增加土壤和空气的接触时间)是目前常见的一种根际增氧途径,而化学物质增氧模式还处于试验阶段。为考察不同增氧模式对水稻根际缺氧调控的田间应用效果,本研究分别于2007年和2008年,采用过氧化尿素(T1)、过氧化钙(T2)以及干湿交替灌溉(T3)的根际增氧模式并以长期淹水田块为对照(CK),监测水稻根系及地上部分形态、生理、光合物质积累及产量形成特征。结果表明,与CK比较,处理T1、T2和T3对国稻1号和秀水09的增产幅度2007年分别为3.1%/11.5%、10.2%/14.9%和18.9%/16.4%;2008年分别为11.56%/6.57%、8.48%/9.20%和13.56%/9.39%。使根际增氧的响应大致表现为根系孔隙度下降、齐穗期根体积增大、根系活力提高;前期分蘖数增加较快,有效穗多;叶片叶绿素含量在齐穗后下降较慢,剑叶SOD和POD含量较高,MDA含量较低;齐穗后叶片光合作用对穗部干物质积累贡献大。不同增氧模式对水稻生长的影响虽然存在一定的差异,但对土壤淹水导致的根际缺氧胁迫,均起到一定的缓解作用。     

Aneuploid and other cytological tester sets in rye

Summary Cytological tester sets include series of aneuploids (nullisomics, monosomics, trisomics of different types, tetrasomies), series of rearranged chromosomes (translocations, inversions, duplications, deficiencies) and series of chromosomes recognizable by specific microscopically visible markers (C- or other banding, molecular markers). In rye, only a few (mainly tertiary and telocentric) monosomics and no viable nullisomics have been found. Several sets of primary trisomics and some telocentric sets, usually not fully complete, have been developed, but few are still available for gene localization. A few tertiary trisomics have been derived from translocation heterozygotes. Extensively used are different sets of additions of rye chromosomes to wheat. A relatively widely distributed set of marked chromosomes is the Wageningen translocation tester set, complemented with translocations from different other institutions. A disadvantage of rye translocations is insufficient heterozygote semisterility. Series of otherwise rearranged chromosomes have not been reported. Sets of lines with chromosomes conspicuously differing from the standard C-banding pattern have been obtained. Molecular markers are available for most rye chromosome, but lack of heterozygosity, necessary for classification after in situ hybridization is a restriction for use as cytological testers. In the cases of most translocations, C-banding and in situ molecular markers, each separate plant in a segregating population must be screened cytologically, whereas with aneuploid markers or with translocations having sufficient heterozygote semisterility, analyzing segregations is sufficient.     

Synthesis of planar 2T1R non overconstrained parallel mechanisms

Based upon screw theory and set theory, and according to the constraint system between mobile platforms and limbs, the structural conditions of non overconstrained planar 2T1R parallel mechanisms are proposed. Six types of limb constraint patterns are fou     

The improved geometrical constraint model of open-pit mine boundary optimum and its application

This paper develops the improved geometric constraint model (IGCM) based on the 3D block model. The variable-slope excavation cones of each block have been abstracted to collections of nodes and directed edges, and the optimization method has been introduced using the set theory. The IGCM consists of the optimized collection nodes and directed edges. The algorithm based on IGCM has been actualized in DIMINE digital mine system, and is applied to an actual open pit mine boundary optimization engineering. The results shows that IGCM can accurately simulate variable slope angles in any azimuth and elevation changes, and adapt to all open pit mine boundary optimum problems in any complex geological conditions, calculation speed and accurate. It provides a new and effective method for the variable-slope open pit mine boundary optimization problem in complex geological conditions.     

SUFFICIENT CONDITIONS FOR SOLUTIONS TO MIN-MAX PROBLEM WITH SATISFACTION CONDITIONS

In this paper, we prove that when objective functions and constraint-functions are three classes of nonconvex functions, necessary conditions for solutions to min-max problem with satisfaction conditions given in [1] are sufficient conditions.