一类多目标分式规划的二阶对称对偶问题

研究一类多目标分式规划的二阶对称对偶问题.在二阶F-凸性假设下给出了对偶问题的弱对偶、强对偶和逆对偶定理.并在对称和反对称假设下研究了该问题的自身对偶性.     

多目标规划的对偶二阶条件

本文针对多目标规划 ( VP)的 Lagrange对偶规划 ( VD) ,从几何直观的角度出发 ,给出对偶规划( VD)的二阶最优性条件 ,即对偶二阶条件 ,并证明了相应的最优性定理 .     

含有锥约束的多目标变分问题的广义对称对偶性

本文研究了一类含有锥约束多目标变分问题的广义对称对偶性.利用函数的(F,ρ)-不变凸性的条件,得出了多目标变分问题关于有效解的弱对偶定理、强对偶定理和逆对偶定理,将多目标变分问题的对称对偶性理论推广到含有锥约束的广义对称对偶性上来.     

半无限规划的对偶性

本文对半无限凸规划提出一个新的对偶问题,它由扰动函数及其次微分刻划.同时讨论了弱对偶性、强对偶性及逆对偶性,证明强对偶性等价于鞍点准则.     

E-凸条件下多目标规划的Mond-Weir型对偶研究

本文主要研究E-凸函数的若干性质,引入E-凸多目标规划的定义,建立E-凸多目标规划的Mond-Weir型对偶问题,并在E.凸条件假设下,证明E-凸多目标规划的弱对偶性、直接对偶性及逆对偶性.     

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

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

均衡约束数学规划问题的一类广义Mond-Weir型对偶理论

针对均衡约束数学规划模型难以满足约束规范及难于求解的问题,基于Mond和Weir提出的标准非线性规划的对偶形式,利用其S稳定性,建立了均衡约束数学规划问题的一类广义Mond-Weir型对偶,从而为求解均衡约束优化问题提供了一种新的方法.在Hanson-Mond广义凸性条件下,利用次线性函数,分别提出了弱对偶性、强对偶性和严格逆对偶性定理,并给出了相应证明.该对偶化方法的推广为研究均衡约束数学规划问题的解提供了理论依据.     

群体多目标规划的联合Mond-Weir对偶

对于目标和约束均为不对称的群体多目标规划问题,本文研究它的联合有效解类 的Mond—Weir型对偶性,得到了相应的弱对偶定理、直接对偶定理和逆对偶定理.     

非线性规划问题的二阶对称对偶性

本文讨论了二阶凸和二阶凹条件下的二阶对称对偶问题,并利用有效性和真有效性概念证明了弱对偶、强对偶、逆对偶及自对偶定理。     

广义凸多目标规划的Mond─Weir型对偶性

本文研究带不等式和等式约束的多目标规划的Ｍｏｎｄ－Ｗｅｉｒ型对偶性理论。在目标和约束是广义凸的假设下，证明了弱对偶定理、直接对偶定理以及逆对偶定理     

Applications of Clark duality to periodic solutions with minimal period for discrete Hamiltonian systems

By making use of Clark duality, perturbation technique and dual least action principle, some results on the existence of subharmonic solutions with minimal period to second-order subquadratic discrete Hamiltonian systems are obtained.     

Stable zero duality gaps in convex programming: Complete dual characterisations with applications to semidefinite programs

The zero duality gap that underpins the duality theory is one of the central ingredients in optimisation. In convex programming, it means that the optimal values of a given convex program and its associated dual program are equal. It allows, in particular, the development of efficient numerical schemes. However, the zero duality gap property does not always hold even for finite-dimensional problems and it frequently fails for problems with non-polyhedral constraints such as the ones in semidefinite programming problems. Over the years, various criteria have been developed ensuring zero duality gaps for convex programming problems. In the present work, we take a broader view of the zero duality gap property by allowing it to hold for each choice of linear perturbation of the objective function of the given problem. Globalising the property in this way permits us to obtain complete geometric dual characterisations of a stable zero duality gap in terms of epigraphs and conjugate functions. For convex semidefinite programs, we establish necessary and sufficient dual conditions for stable zero duality gaps, as well as for a universal zero duality gap in the sense that the zero duality gap property holds for each choice of constraint right-hand side and convex objective function. Zero duality gap results for second-order cone programming problems are also given. Our approach makes use of elegant conjugate analysis and Fenchel's duality.     

A note on multiobjective second-order symmetric duality

In this paper, we establish a strong duality theorem for a pair of multiobjective second-order symmetric dual programs. This removes an omission in an earlier result by Yang et al. [X.M. Yang, X.Q. Yang, K.L. Teo, S.H. Hou, Multiobjective second-order symmetric duality with F-convexity, Euro. J. Oper. Res. 165 (2005) 585–591].     

Second-Order Duality for Nondifferentiable Multiobjective Programming Problems

This paper is concerned with second-order duality for a class of nondifferentiable multiobjective programming problems. Usual duality theorems are proved for Mangasarian type and general Mond–Weir type vector duals under generalized bonvexity assumptions.     

Second-Order Duality in Multiobjective Programming Involving (F, α, ρ, d)-V-Type I Functions

In this paper, a new class of second-order (F, α, ρ, d)-V-type I functions is introduced that generalizes the notion of (F, α, ρ, θ)-V-convex functions introduced by Zalmai (Computers Math. Appl. 2002; 43:1489–1520) and (F, α, ρ, p, d)-type I functions defined by Hachimi and Aghezzaf (Numer. Funct. Anal. Optim. 2004; 25:725–736). Based on these functions, weak, strong, and strict converse duality theorems are derived for Wolfe and Mond–Weir type multiobjective dual programs in order to relate the efficient and weak efficient solutions of primal and dual problems.     

Duality in nonlinear programming

In this paper are defined new first- and second-order duals of the nonlinear programming problem with inequality constraints. We introduce a notion of a WD-invex problem. We prove weak, strong, converse, strict converse duality, and other theorems under the hypothesis that the problem is WD-invex. We obtain that a problem with inequality constraints is WD-invex if and only if weak duality holds between the primal and dual problems. We introduce a notion of a second-order WD-invex problem with inequality constraints. The class of WD-invex problems is strictly included in the class of second-order ones. We derive that the first-order duality results are satisfied in the second-order case.     

Second-order duality for the variational problems

A dual problem associated with a class of variational problems is formulated that involves second derivatives of the functions. Under the invexity assumptions on the functions that compose the primal problems, second-order duality results (weak duality, strong duality and converse duality) are derived for this pair of problems.     

Multiobjective second-order symmetric duality with F-convexity

We suggest a pair of second-order symmetric dual programs in multiobjective nonlinear programming. For these second-order symmetric dual programs, we prove the weak, strong and converse duality theorems under F-convexity conditions.     

Symmetric duality for second-order fractional programs

In this paper, a pair of symmetric dual second-order fractional programming problems is formulated and appropriate duality theorems are established. These results are then used to discuss the minimax mixed integer symmetric dual fractional programs.     

Second-order symmetric duality with cone constraints

Wolfe and Mond–Weir type second-order symmetric duals are formulated and appropriate duality theorems are established under η-bonvexity/η-pseudobonvexity assumptions. This formulation removes several omissions in an earlier second-order primal dual pair introduced by Devi [Symmetric duality for nonlinear programming problems involving η-bonvex functions, European J. Oper. Res. 104 (1998) 615–621].