The paper sets up a new dual problem of a nondifferentiable convex programming problem and proves its dual properties such as weak duality, strong duality and converse duality.
本文对非可微凸规划问题建立了一个新的对偶问题 ,并证明其对偶性质 ,如弱对偶性 ,强对偶性及逆对偶性。
In this paper,a new dual problem for nondifferentiable convex programming problem was introduced and the weak duality,the strong duality and the converse duality were proved without any constraint qualification.
本文引入一个关于非可微凸规划问题的新的对偶问题，在无约束规格的情况下证明了弱对偶性、强对偶性及逆对偶性。
In order-reversing involution,complete lattice is calculated and general Pawlak operator is deduced.
我们将这种算子推广到具有逆对合对应的完备格上。
In terms of lattice,this paper discusses and demonstrates the order-reversing involution operator and its corresponding properties in bounded implicative-algebras,on the base of that bounded implicative-algebras and algebra are equivalent algebraic systems each other.
在有界蕴涵BCK-代数与Boole数是等价地代数系统的基础上,从布尔格的角度出发,研究了有界蕴涵BCK-代数的逆对合算子及其相关的一些性质。
On the basis of (F,ρ)_s Convex functions two converse dual theorems of multiobjective programming are given under.
在(F,ρ)s-凸函数的基础上,给出了多目标规划的两个逆对偶定理。