Wolfe type second-order symmetric duality in nondifferentiable programming

A pair of Wolfe type second-order symmetric dual programs involving nondifferentiable functions is considered and appropriate duality theorems are established under η₁-bonvexity/η₂-boncavity. Several known results including that of Mond and Gulati et al. are obtained as special cases.     

Duality for a class of continuous-time homogeneous fractional programming problems

In this note we present a continuous-time analogue of a duality formulation due to Craven and Mond for a class of homogeneous fractional programming problems. In this duality formulation, the dual problem is also a fractional program with the same objective function as the primal problem.

---

Zusammenfassung In dieser Arbeit wird der Dualitätsansatz von Craven und Mond für homogene Quotientenprogramme in endlich vielen Variablen auf unendlich dimensionale Probleme verallgemeinert, wobei Zähler und Nenner sowie die Nebenbedingungsfunktionale als Integrale gegeben sind. Der Ansatz zur Dualität ist dadurch gekennzeichnet, daß das duale Problem wieder ein Quotientenprogramm ist und die gleiche Zielfunktion wie das primale Problem hat.

     

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.     

On duality concepts in fractional programming

The paper (Part I) describes an approach to duality in fractional programming on the basis of another kind of conjugate functions. The connections to some duality concepts (the Lagrange-duality and duality concepts of Craven and Schaible) are investigated and some new proofs of strong duality theorems are given.     

A note on “real and complex Fritz John theorems”

In a recent paper by Craven and Mond a unified proof is given of the Fritz John necessary theorem for nonlinear programming problems over cone domains. This note will underscore some necessary assumptions that are needed to establish this generalization which are not stated, but assumed in the proofs given by Craven and Mond.     

Mond–Weir type second order symmetric duality in non-differentiable minimax mixed integer programming problems

A pair of Mond–Weir type non-differentiable second order symmetric minimax mixed integer primal and dual problems in mathematical programming is formulated. Symmetric and self-duality theorems are then established under second order F-pseudo-convexity assumptions. Several known results including that of Gulati and Ahmad [Eur. J. Oper. Res. 101 (1997) 122], Hou and Yang [J. Math. Anal. Appl. 255 (2001) 491] and Mond and Schechter [Bull. Aust. Math. Soc. 53 (1996) 177], as well as others are obtained as special cases.     

广义不变凸非线性分式规划的对偶性

Craven研究了一类非线性分式规划的对偶性．本文减弱了文献中主要定理的条件，得到了相同的结果．同时，还获得了几个新结果及讨论了逆对偶性．     

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.     

Equivalence of saddle-points and optima, and duality for a class of non-smooth non-convex problems

The equivalence between saddle-points and optima, and duality theorems are established for a much larger class of non-smooth non-convex problems in which functions are locally Lipschitz and are satisfying invex-type conditions of Hanson and Craven.     

Nondifferentiable second order symmetric duality in multiobjective programming

A pair of Mond–Weir type nondifferentiable multiobjective second order symmetric dual programs is formulated and symmetric duality theorems are established under the assumptions of second order F-pseudoconvexity/F-pseudoconcavity.     

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.     

Invex multifunctions and duality

For optimization problems with multifunction objective and constraints, duality theorems are proved for analogs of the Wolfe and Mond–Weir dual problems, assuming that the multifunctions satisfy a generalization of the invex property for functions. Several characterizations of generalized invexity are obtained.     

Second order symmetric duality in non-differentiable multiobjective programming with F-convexity

This paper is concerned with a pair of Mond–Weir type second order symmetric dual non-differentiable multiobjective programming problems. We establish the weak and strong duality theorems for the new pair of dual models under second order F-convexity assumptions. Several results including many recent works are obtained as special cases.     

Higher-order $$(\Phi , \rho )\hbox {-}V$$-invexity and duality for vector optimization problems

In this paper, we introduce the concept of higher-order \((\Phi , \rho )\hbox {-}V\)-invex function and prove duality theorems for higher-order Wolfe and Mond–Weir type duals of the vector optimization problem using aforesaid assumptions.     

Nondifferentiable multiobjective Mond–Weir type second-order symmetric duality over cones

In this paper, a pair of Mond–Weir type nondifferentiable multiobjective second-order symmetric dual programs over arbitrary cones is formulated. Weak, strong and converse duality theorems are established under second-order K–F-convexity/K–η-bonvexity assumptions. A self duality theorem is also obtained by assuming the functions involved to be skew-symmetric.     

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

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

Sufficient optimality conditions and duality for a quasiconvex programming problem

Under differentiability assumptions, Fritz John Sufficient optimality conditions are proved for a nonlinear programming problem in which the objective function is assumed to be quasiconvex and the constraint functions are assumed to quasiconcave/strictly pseudoconcave. Duality theorems are proved for Mond-Weir type duality under the above generalized convexity assumptions.The first author is thankful to the Natural Science and Engineering Research Council of Canada for financial support through Grant No. A-5319. The authors are thankful to Professor B. Mond for suggestions that improved the original draft of the paper.     

Nonsmooth multiobjective programming: strong Kuhn–Tucker conditions

We consider a multiobjective optimization problem with a feasible set defined by inequality and equality constraints and a set constraint, where the objective and constraint functions are locally Lipschitz. Several constraint qualifications are given in such a way that they generalize the classical ones, when the functions are differentiable. The relationships between them are analyzed. Then, we establish strong Kuhn–Tucker necessary optimality conditions in terms of the Clarke subdifferentials such that the multipliers of the objective function are all positive. Furthermore, sufficient optimality conditions under generalized convexity assumptions are derived. Moreover, the concept of efficiency is used to formulate duality for nonsmooth multiobjective problems. Wolf and Mond–Weir type dual problems are formulated. We also establish the weak and strong duality theorems.     

多目标数学规划的对偶性

<正> R.R.Egudo 和M.A.Hanson 在文[2]中讨论了如下一类多目标数学规划的对偶性其中f:R~n→R~k,g:R~n→R~m 是向量值函数,e=(1,1,…,1)~T ∈R~k,λ∈W~(++)={ω|ω_i>0,sum from i=1 to k ω_i=1}。文[2]对多目标非凸规划(VP)和(VD)关于真有效解给出了弱对偶和强对偶定理。本文将(VP)和(VD)推广为如下一类常闭凸锥约束的多目标数学规划问题     

Mixed duality without a constraint qualification for minimax fractional programming

Without the need of a constraint qualification, we establish the necessary and sufficient optimality conditions for minimax fractional programming. Using these optimality conditions, we construct a mixed dual model which unifies the Mond–Weir dual, Wolfe dual and a parameter dual models. Several duality theorems are established. Consequently, this article partly solves the problem posed by Lai et al. [H.C. Lai, J.C. Liu and K. Tanaka (1999). Duality without a constraint qualification for minimax fractional programming. Journal of Optimization Theory and Applications, 101, 109–125.].