凸规划

A kind of neural network for solving quadratic programming problems on a closed convex set.

一种求解闭凸集上二次规划问题的神经网络模型。

For solving problem (1), this dissertation first presents a sufficient and necessary condition by dealing with inequalities using projection operator in convex analysis, and then proposes a kind of new neural network model based on the constraint domain:〓(2) Where P is a projection operator on Q.

本文利用凸分析中的投影算子处理不等式约束，首先给出二次规划问题(1)解存在的充分和必要条件，据于此提出一种新的基于约束区域神经网络模型〓(2)来进行求解，其中P为Q上的投影算子。

Third,a nonlinear programming model is given for the coexistence of multi-prices on the basis of the convex function model.

再次，在凸需求函数模型下给出多种价格并存的非线性规划模型。

According to the viewpoint of combination tope, any convex polyhedron can be composed of some simplexes, and both convex polyhedron and simplex are important concepts of programming theory, so it's necessary to find their volumes in some calculations.

由组合拓扑学可知，任意凸多面体均为若干个单纯形的某种组合，两者均为规划论中最重要的基本概念之一，因而在一些计算中对其求积是不可少的。

Moreover,it has generality,and includes the other models for convex quadratic programming.

此外该网络具有一般性，包括了其它解凸二次规划问题的模型。

Based on the primal-dual logarithmic-barrier method, a new algorithm for convex quadratic programming with equality and non-equality constrains is discussed.

在此基础上提出了求解带有等式约束和不等式约束的凸二次规划的牛顿内点算法。

The convex quadratic programming is an important branch of mathematical programming.

凸二次规划是数学规划中的一个重要分支，它在经济，市场均衡，管理，军事等各个领域均有重要应用。

Firstly, this paper definited pseudometric d for n -foldproduct of σ-algebra A of subsets of a given set X , and definited indicator function ; secondly, gave the concept of differentiable of set function at S° and concept of partial derivative at S° with respect to the ith argument Si through indicator function, and defound the weak efficient solution of and optimality necessary condition; Finally, obtained three weak duality results and strong duality results under generalized convexity conditions.

首先，对已知集X的子集的σ-代数A的n-折积A^n，定义了伪度量d，给出了相应的特征函数〈h，Is〉；其次，通过特征函数给出了集函数在S 可微的定义及集函数在S 关于第i个变量Si的偏导数定义；给出了多目标规划问题的弱有效解概念及的最优性必要条件；最后，分别在目标函数和约束函数的3种较弱凸性条件下，研究n-集函数多目标规划问题的对偶问题，获得了3个弱对偶结果和强对偶结果。

Chapter3, being the main part of this dissertation, converts nonconvex semidefinite programming problem to nonlinear programming problem, and proves that under transversality condition, strict complementarity condition and the sufficient optimality condition of local solutions, and are equivalent locally.

第3章是本文的主要部分，将非凸半定规划问题转化为等式约束的非线性规划问题，并证明了在局部解的充分性条件及严格互补松弛与非退化条件之下两问题的局部等价性。

The subgoal determination strategy of rolling path planning is analyzed according to various convex obstacle environment.

文中分析了不同凸障碍环境下滚动路径规划子目标选择策略，并且还探讨了规划算法的可达性。

Cynanchum Lingtai apricot production in the average weight 65 grams, the brightly-colored fruit, juicy rich, sweet-sour taste, sweet from the nucleolus, when the late Qing Dynasty famous Shaanxi, Gansu provinces, the Qing imperial court Tongzhi tribute for years.

灵台生产的牛心杏平均单果重65克，果实色泽鲜艳，汁多味浓，甜酸适口，离核仁甜，清末时就驰名陕、甘两省，清同治年间曾为朝廷贡品。

Chenopodium album,Solanum nigrum, and Amaranthus retroflexus were very susceptible to the herbicides. Polygonum persicaria and Abutilon theophrasti were relatively less susceptible to the herbicides, and Lycopersicon esculentum was not susceptible to it. The relationship between reduction rates of weed biomass and PPM values of weed leaves 2,4, and 6 days after treatment was established.

供试的6种杂草对该混剂的敏感性存在显著差异：红心藜Chenopodium album、龙葵Solanum nigrum和反枝苋Amaranthus retroflexus对该混剂最敏感，ED90值分别为47.65、71.67和29.17g/hm2；春蓼Polygonum persicaria和苘麻Abutilon theophrasti敏感，ED90值分别为96.91、114.20g/hm2；而番茄不敏感。