首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到10条相似文献,搜索用时 78 毫秒
1.
In this paper, three sufficient conditions are given, one of which modifies the previous result given by Singh (Ref. 1) under the assumption of convexity of the functions involved at the Pareto-optimal solution. A counterexample has been furnished which shows that the convexity assumption cannot be extended to include the quasiconvexity case. The second theorem on sufficiency requires the strict pseudoconvexity of the functions involved.  相似文献   

2.
In the literature, when dealing with equilibrium problems and the existence of their solutions, the most used assumptions are the convexity of the domain and the generalized convexity and monotonicity, together with some weak continuity assumptions, of the function. In this paper, we focus on conditions that do not involve any convexity concept, neither for the domain nor for the function involved. Starting from the well-known Ekeland's theorem for minimization problems, we find a suitable set of conditions on the function f that lead to an Ekeland's variational principle for equilibrium problems. Via the existence of ε-solutions, we are able to show existence of equilibria on general closed sets for equilibrium problems and systems of equilibrium problems.  相似文献   

3.
Necessary and sufficient conditions of optimality are given for a nonlinear nondifferentiable program, where the constraints are defined via closed convex cones and their polars. These results are then used to obtain an existence theorem for the corresponding stationary point problem, under some convexity and regularity conditions on the functions involved, which also guarantee an optimal solution to the programming problem. Furthermore, a dual problem is defined, and a strong duality theorem is obtained under the assumption that the constraint sets of the primal and dual problems are nonempty.  相似文献   

4.
The aim of this paper is to prove the existence of equilibrium for generalized games or abstract economies in contexts where the convexity conditions on strategy spaces and preference correspondences are relaxed and an arbitrary number of agents is considered. The results are based on a fixed-point theorem in which the convexity condition on sets and images of correspondences is replaced by a general notion of abstract convexity, called mc-spaces, generalizing the notions of simplicial convexity, H-spaces, and G-convex spaces.  相似文献   

5.
The minimax theorem for a convex-concave bifunction is a fundamental theorem in optimization and convex analysis, and has a lot of applications in economics. In the last two decades, a nonconvex extension of this minimax theorem has been well studied under various generalized convexity assumptions. In this note, by exploiting the hidden convexity (joint range convexity) of separable homogeneous polynomials, we establish a nonconvex minimax theorem involving separable homogeneous polynomials. Our result complements the existing study of nonconvex minimax theorem by obtaining easily verifiable conditions for the nonconvex minimax theorem to hold.  相似文献   

6.
The paper produces new versions of the minimax theorem based on original conditions. Moreover, we investigate not only the sufficiency, but also the necessity of such conditions. The proofs are very simple and preclude any topological technique.  相似文献   

7.
A monotonicity result is utilized to derive sufficient optimality conditions of considerable generality for an individual trajectory in control theory. The sufficiency theorem embodying these conditions generalizes those of Boltyanskii and Leitmann and is applied to a simple control system to which their sufficiency theorems are not applicable. Conditions on the state equations and state space are completely relaxed. The set of admissible controls is extended to the set of measurable controls and the integrand of the performance index has its membership extended to the class of bounded Borel-measurable functions. The decomposition of the state space is required to be onlyplain denumerable.  相似文献   

8.
首先引入局部凸空间的k-一致极凸性和k-一致极光滑性这一对对偶概念,它们既是Banach空间k-一致极凸性和k-一致极光滑性推广,又是局部凸空间一致极凸性和一致极光滑性的自然推广.其次讨论它们与其它k-凸性(k-光滑性)之间的关系.最后,在P-自反的条件下给出它们之间的等价对偶定理.  相似文献   

9.
First order necessary optimality conditions for a minimum of an inequality constrained minimization problem are given in terms of approximate quasidifferentials, without the usual differentiability, convexity or locally Lipschitz assumptions. The main result is obtained with the help of a semi-infinite Gordan type alternative theorem. Sufficient conditions for a minimum are also given with the usual convexity assumption replaced by an invex condition.  相似文献   

10.
文献[1]中给出了有关条件期望与三个随机变量独立的两个充要条件,本文通过几个反例说明其充分性是不成立的.分析了文献[4]中一个定理证明存在的错误,并给出了新的证明.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号