广义次似凸集值优化的鞍点定理

讨论广义次似凸集值优化的鞍点定理.给出广义次似凸集值映射的两个性质.定义广义次似凸集值优化的Fritz-John鞍点和Kuhn-Tucker鞍点.获得一系列广义次似凸集值优化的鞍点定理.     

关于向量集值优化的Benson真有效性

对广义锥次数凸向量集值优化问题Benson真有效性解的标量化问题进行了研究,借助于一种新的择一性定理建立了广义锥次类凸向是集值优化问题Benson真有效解的Lagrange乘子型定理并讨论了乘子型对偶问题。     

集值优化问题超有效解的高阶Mond-Weir对偶

在实赋范线性空间中利用锥方向高阶广义邻接导数研究带约束的集值优化在超有效解意义下的高阶Mond-Weir对偶问题.在广义锥-凸假设下,利用锥方向高阶广义邻接导数的性质借助凸集分离定理得到了强对偶定理.利用超有效点的标量化定理得到逆对偶定理.     

集值映射向量优化问题的ε-超鞍点和ε-对偶定理

本文研究集值映射向量优化问题的ε-超鞍点和ε-对偶定理。在集值映射是近似广义锥次似凸的假设下，利用ε-超有效解的标量化和Lagrange乘子定理，建立和证明了关于ε-超有效解的鞍点和对偶定理。     

序线性空间中广义半似凸集值映射向量优化的Benson真有效性

在序线性空间中建立了广义半似凸集值映射的择一定理.利用向量闭包,引进了集值优化的Benson真有效解.在广义半似凸的假设下,获得了Benson真有效性意义下的标量化定理,Lagrangian乘子定理和鞍点定理.     

集值映射向量最优化的最优性条件

本文在序线性拓扑空间中,证明了广义Y+一次似凸集值映射的一个择一性定理,利用此定理,我们得到集值映射向量最优化问题的最优性条件.     

集值优化问题ε-严有效解的二阶Mond-Weir对偶

在实赋范线性空间中研究带约束的集值优化在ε-严有效意义下的二阶Mond-Weir对偶问题.利用广义二阶邻接导数的性质,借助凸集分离定理得到了强对偶定理.利用ε-严有效点的性质得到了逆对偶定理.     

近似锥一次类凸集值向量优化问题强有效解的广义鞍点刻画

本文研究了近似锥一次类凸集值向量优化强有效解的广义鞍点表示问题.利用择一定理,得到了近似锥-次类凸集值优化问题强有效解为广义鞍点的充分条件和必要条件.所得结果丰富了集值优化理论,并且拓广了广义鞍点的应用.     

集值映射向量优化问题的ε—超有效解

本文引进了集值映射向量优化问题的ε－超有效解概念,并在集值映射为近似广义锥次似凸的假设下,建立了关于ε－超有效解的标量化定理和Lagrange乘子定理。     

一类锥约束多目标优化问题的高阶对偶研究

在一类锥约束单目标优化问题的一阶对偶模型基础之上,建立了锥约束多目标优化问题的二阶和高阶对偶模型.在广义凸性假设下,给出了弱对偶定理,在Kuhn-Tucker约束品性下,得到了强对偶定理.最后,在弱对偶定理的基础上,利用Fritz-John型必要条件建立了逆对偶定理.     

Optimality conditions of set-valued optimization problem involving relative algebraic interior in ordered linear spaces

In this article, firstly, a generalized cone subconvexlike set-valued map involving the relative algebraic interior is introduced in ordered linear spaces. Secondly, some properties of a generalized cone subconvexlike set-valued map are investigated. Finally, the optimality conditions of set-valued optimization problem are established.     

向量集值优化超有效解的对偶问题

借助于Contingent切锥和集值映射的上图而引入的有关集值映射的Contingent切导数，对约束集值优化问题的超有效解建立了最优性Kuhn Tucker必要及充分性条件,借此建立了向量集值优化超有效解的Wolfe型和Mond Weir型对偶定理.     

Superefficiency in Vector Optimization with Nearly Subconvexlike Set-Valued Maps

In the framework of locally convex topological vector spaces, we establish a scalarization theorem, a Lagrange multiplier theorem and duality theorems for superefficiency in vector optimization involving nearly subconvexlike set-valued maps.     

Necessary and Sufficient Conditions for Minimax Fractional Programming

We establish the necessary and sufficient optimality conditions for a class of nondifferentiable minimax fractional programming problems solving generalized convex functions. Subsequently, we apply the optimality conditions to formulate one parametric dual problem and we prove weak duality, strong duality, and strict converse duality theorems.     

Complex Minimax Fractional Programming of Analytic Functions

We prove that a minmax fractional programming problem is equivalent to a minimax nonfractional parametric problem for a given parameter in complex space. Using a parametric approach, we establish the Kuhn-Tucker type necessary optimality conditions and prove the existence theorem of optimality for complex minimax fractional programming in the framework of generalized convexity. Subsequently, we apply the optimality conditions to formulate a one-parameter dual problem and prove weak duality, strong duality, and strict converse duality theorems involving generalized convex complex functions. This research was partly supported by NSC, Taiwan.     

向量值最优化问题的最优性条件与对偶性

本文我们首先给出一类向量值优化问题（VP）的正切锥真有效解的定义，在锥方向导数的假设下，讨论了一类单目标问题 的最优性必要条件；然后利用正切锥方向导数定义一类正切锥F－凸函数类，并给出了（VP）正切锥真有效解的充分性条件，最后我们亦讨论了（VP）在正切锥真有效解意义下的对偶性质。     

Mixed Type Duality for Set-valued Optimization Problems via Higher-order Radial Epiderivatives

In this article, we introduce a notion of higher-order radial epiderivative for set-valued maps and study its properties. A generalized concept of higher-order strict minimizers in set-valued optimization is proposed as well. By virtue of the radial epiderivative, we establish a mixed dual problem, and then weak, strong, and converse duality theorems are obtained in dealing with generalized strict minimizers.     

Duality and saddle-point type optimality for generalized nonlinear fractional programming

In this paper, we establish two theorems of alternative with generalized subconvexlikeness. We introduce two dual models for a generalized fractional programming problem. Theorems of alternative are then applied to establish duality theorems and a saddle-point type optimality condition.     

Higher-order generalized Studniarski epiderivative and its applications in set-valued optimization

In the paper, we introduce the higher-order generalized Studniarski epiderivative of set-valued maps. Via this concept, some results on optimality conditions and duality for set-valued optimization problems are established.