线性乘积和规划已出现在工程实践和管理科学等领域,是一类NP-难问题。针对该问题目标函数的特殊结构,将其重构为一个D.C.(difference of convex functions)规划问题。再利用凹函数的凸包络,构造出了一种D.C.松弛问题,并将其分解为两个...线性乘积和规划已出现在工程实践和管理科学等领域,是一类NP-难问题。针对该问题目标函数的特殊结构,将其重构为一个D.C.(difference of convex functions)规划问题。再利用凹函数的凸包络,构造出了一种D.C.松弛问题,并将其分解为两个凸子问题。然后将该D.C.松弛与超矩形的标准二分法相结合,设计了新的分支定界算法,并分析了其理论收敛性和计算复杂度。最后,借助大量数值实验验证了该算法的有效性。展开更多
本文是D.C.隶属函数模糊集及其应用系列研究的第二部分。指出在实际问题中普遍选用的三角形、半三角形、梯形、半梯形、高斯型、柯西型、S形、Z形、π形隶属函数模糊集等均为D.C.隶属函数模糊集,建立了D.C.隶属函数模糊集对模糊集的万...本文是D.C.隶属函数模糊集及其应用系列研究的第二部分。指出在实际问题中普遍选用的三角形、半三角形、梯形、半梯形、高斯型、柯西型、S形、Z形、π形隶属函数模糊集等均为D.C.隶属函数模糊集,建立了D.C.隶属函数模糊集对模糊集的万有逼近性。探讨了D.C.隶属函数模糊集与模糊数之间的关系,给出了用D.C.隶属函数模糊集逼近模糊数的-εC e llina逼近形式,得到模糊数与D.C.函数之间的一个对应算子,指出了用模糊数表示D.C.函数的问题。展开更多
In this paper,the I-ring which satisfies almost descending chain conditions(shorten writting A.D.C.C)on principal left ideals is studied.Two main results are gaven:(1)I-ring which satisfies A.D.C.C on principal left i...In this paper,the I-ring which satisfies almost descending chain conditions(shorten writting A.D.C.C)on principal left ideals is studied.Two main results are gaven:(1)I-ring which satisfies A.D.C.C on principal left ideals is Boolen.(2)Ring with identity whose principal left ideals satisfy A.D.C.C and of which each element except identity is a left zero-divisor,is Boolean.These results generalize the results of[1],[2]and[3].展开更多
Some properties of a class of quasi-differentiable functions(the difference of two finite convex functions) are considered in this paper. And the convergence of the steepest descent algorithm for unconstrained and c...Some properties of a class of quasi-differentiable functions(the difference of two finite convex functions) are considered in this paper. And the convergence of the steepest descent algorithm for unconstrained and constrained quasi-differentiable programming is proved.展开更多
This book was written by five authors. I had met two of them, the first and third author. The first author, Steven Wayne Lingafelter, is a research entomologist with the Systematic Entomology Laboratory, USDA, based a...This book was written by five authors. I had met two of them, the first and third author. The first author, Steven Wayne Lingafelter, is a research entomologist with the Systematic Entomology Laboratory, USDA, based at the Smithsonian Institution's National Museum of Natural History. He has specialized on longhomed woodboring beetles for almost three decades and currently specializes on the Neotropical fauna.展开更多
In this paper, the uV-theory and P-differential calculus are employed to study second-order expansion of a class of D,C, functions and minimization problems. Under certain conditions, some properties of the u-Lagrangi...In this paper, the uV-theory and P-differential calculus are employed to study second-order expansion of a class of D,C, functions and minimization problems. Under certain conditions, some properties of the u-Lagrangian, the second-order expansion of this class of functions along some trajectories are formulated. Some first and second order optimality conditions for the class of D,C, optimization problems are given.展开更多
摘要线性乘积和规划已出现在工程实践和管理科学等领域,是一类NP-难问题。针对该问题目标函数的特殊结构,将其重构为一个D.C.(difference of convex functions)规划问题。再利用凹函数的凸包络,构造出了一种D.C.松弛问题,并将其分解为两个凸子问题。然后将该D.C.松弛与超矩形的标准二分法相结合,设计了新的分支定界算法,并分析了其理论收敛性和计算复杂度。最后,借助大量数值实验验证了该算法的有效性。
摘要本文是D.C.隶属函数模糊集及其应用系列研究的第二部分。指出在实际问题中普遍选用的三角形、半三角形、梯形、半梯形、高斯型、柯西型、S形、Z形、π形隶属函数模糊集等均为D.C.隶属函数模糊集,建立了D.C.隶属函数模糊集对模糊集的万有逼近性。探讨了D.C.隶属函数模糊集与模糊数之间的关系,给出了用D.C.隶属函数模糊集逼近模糊数的-εC e llina逼近形式,得到模糊数与D.C.函数之间的一个对应算子,指出了用模糊数表示D.C.函数的问题。
摘要In this paper,the I-ring which satisfies almost descending chain conditions(shorten writting A.D.C.C)on principal left ideals is studied.Two main results are gaven:(1)I-ring which satisfies A.D.C.C on principal left ideals is Boolen.(2)Ring with identity whose principal left ideals satisfy A.D.C.C and of which each element except identity is a left zero-divisor,is Boolean.These results generalize the results of[1],[2]and[3].
基金Supported by the State Foundations of Ph.D.Units(20020141013)Supported by the NSF of China(10001007)
摘要Some properties of a class of quasi-differentiable functions(the difference of two finite convex functions) are considered in this paper. And the convergence of the steepest descent algorithm for unconstrained and constrained quasi-differentiable programming is proved.
摘要This book was written by five authors. I had met two of them, the first and third author. The first author, Steven Wayne Lingafelter, is a research entomologist with the Systematic Entomology Laboratory, USDA, based at the Smithsonian Institution's National Museum of Natural History. He has specialized on longhomed woodboring beetles for almost three decades and currently specializes on the Neotropical fauna.
基金Supported by the Foundations of Ph.D.Units,the Ministry of Education(20020141013)National Natural Science Foundation of China(No.10001007)
摘要In this paper, the uV-theory and P-differential calculus are employed to study second-order expansion of a class of D,C, functions and minimization problems. Under certain conditions, some properties of the u-Lagrangian, the second-order expansion of this class of functions along some trajectories are formulated. Some first and second order optimality conditions for the class of D,C, optimization problems are given.