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

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

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

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

群体多目标最优化的Lagrange对偶性

本文建立了目标和约束为不对称的群体多目标最优化问题的Lagrange对偶规划，在问题的联合弱有效解意义下，得到群体多目标最优化Lagrange型的弱对偶定理、基本对偶定理、直接对偶定理和逆对偶定理。     

非可微多目标优化问题的高阶逆对偶定理

在锥约束非可微多目标优化问题Mond-Weir型高阶弱对偶定理的基础上,利用Fritz-John型必要条件,在没有任何约束品性条件下给出了逆对偶定理.最后,考虑了特殊情况,研究了单目标情况下对偶问题的逆对偶定理.     

一类非光滑优化问题的最优性与对偶（英文）

本文研究了一类带等式和不等式约束的非光滑多目标优化问题,给出了该类问题的Karush-Kuhn-Tucker最优性必要条件和充分条件,建立了该类规划问题的一类混合对偶模型的弱对偶定理、强对偶定理、逆对偶定理、严格逆对偶定理和限制逆对偶定理.     

一类非光滑优化问题的最优性与对偶

本文研究了一类带等式和不等式约束的非光滑多目标优化问题,给出了该类问题的Karush-Kuhn-Tucker最优性必要条件和充分条件,建立了该类规划问题的一类混合对偶模型的弱对偶定理、强对偶定理、逆对偶定理、严格逆对偶定理和限制逆对偶定理.     

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

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

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

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

E-凸多目标规划的最优性及Wolfe型对偶

先引入了一类带不等式和等式约束的E-凸多目标优化问题(MP),给出了该类问题的一个最优性充分条件;其次,建立了该类规划问题(MP)的一类Wolfe型对偶模型(WD),并在E-凸条件下,获得了弱对偶定理,强对偶定理和逆对偶定理.     

非光滑(F,ρ,)θ-d一致不变凸广义分式规划的对偶性

结合F-凸,η-不变凸及d一致不变凸的概念给出了非光滑广义(F,ρ,θ)-d一致不变凸函数;就一类在凸集C上目标函数为Lipschitz连续的带有可微不等式约束的广义分式规划,提出一个对偶,并利用在广义Kuhn-Tucker约束品性或广义Arrow-Hurwicz-Uzawa约束品性的条件下得到的最优性必要条件,证明相应的弱对偶定理、强对偶定理及严格逆对偶定理.     

Duality Theorems of Multiobjective Programming for a Class of Generalized Convex Functions

1.DefinitionsDefinition1.AfunctionalF(x)inthespaceVCE"issaidtobeasublinearfunctionalifforx,yeV,andor20,Inparticular,F(0)=0.Letop(x)beadifferentiablerealfunctiononasetCCEd.ForagivensublinearfunctionFandafunctionp:CxC-EIIp(x,u)/0(x/u),themoregeneralgeneralizedconvexfunctioncanbedefinedasthefollwing:Definition2.op(x)issaidtobe(F,p)--invarialltconvexfunctiononCifforxl,xZECDefinition3.op(x)issaidtobe(F,P)--invariantquasiconvexfunctiononCifforal,xZECthatis,Definition4.op(x)issaidtobe(F,…     

On duality theory in multiobjective programming

In this paper, we study different vector-valued Lagrangian functions and we develop a duality theory based upon these functions for nonlinear multiobjective programming problems. The saddle-point theorem and the duality theorem are derived for these problems under appropriate convexity assumptions. We also give some relationships between multiobjective optimizations and scalarized problems. A duality theory obtained by using the concept of vector-valued conjugate functions is discussed.The author is grateful to the reviewer for many valuable comments and helpful suggestions.     

Symmetric duality in multiobjective programming involving generalized cone-invex functions

In this paper, cone-pseudoinvex and strongly cone-pseudoinvex functions are defined. A pair of Mond–Weir type symmetric dual multiobjective programs is formulated over arbitrary cones. Weak duality, strong duality and converse duality theorems are established using the above-defined functions. A self-duality theorem is also given by assuming the functions involved to be skew-symmetric.     

Second order symmetric duality in multiobjective programming

A pair of Mond–Weir type multiobjective second order symmetric dual programs are formulated without non-negativity constraints. Weak duality, strong duality and converse duality theorems are established under η-bonvexity and η-pseudobonvexity assumptions. A second order self-duality theorem is given by assuming the functions involved to be skew-symmetric.     

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

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

Sandwich theorem for quasiconvex functions and its applications

In convex programming, sandwich theorem is very important because it is equivalent to Fenchel duality theorem. In this paper, we investigate a sandwich theorem for quasiconvex functions. Also, we consider some applications for quasiconvex programming.     

A generalization of the Gronwall-Bellman lemma and its applications

In this study we present an important theorem of the alternative involving convex functions and convex cones. From this theorem we develop saddle value optimality criteria and stationary optimality criteria for convex programs. Under suitable constraint qualification we obtain a generalized form of the Kuhn-Tucker conditions. We also use the theorem of the alternative in developing an important duality theorem. No duality gaps are encountered under the constraint qualification imposed earlier and the dual problem always possesses a solution. Moreover, it is shown that all constraint qualifications assure that the primal problem is stable in the sense used by Gale and others. The notion of stability is closely tied up with the positivity of the lagrangian multiplier of the objective function.     

A class of nondifferentiable continuous programming problems

Optimality conditions, duality and converse duality results are obtained for a class of continuous programming problems with a nondifferentiable term in the integrand of the objective function. The proofs are based on a Fritz John theorem for constrained optimization in abstract spaces. The results generalize various well-known results in variational problems with differentiable functions, and also give a dynamic analogue of certain nondifferentiable programming problems.