Sarita Sharma

Higher-Order Duality in Nondifferentiable Multiobjective Programming

A new generalized class of higher-order (F, α, ρ, d)–type I functions is introduced, and a general Mond–Weir type higher-order dual is formulated for a nondifferentiable multiobjective programming problem. Based on the concepts introduced, various higher-order duality results are established. At the end, some special cases are also discussed.

Second order duality for minmax fractional programming

In the present paper, two types of second order dual models are formulated for a minmax fractional programming problem. The concept of η-bonvexity/generalized η-bonvexity is adopted in order to discuss weak, strong and strict converse duality theorems.

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.

Symmetric duality for multiobjective fractional variational problems involving cones

In this paper, a pair of multiobjective fractional variational symmetric dual problems over cones is formulated. Weak, strong and converse duality theorems are established under generalized F-convexity assumptions. Moreover, self duality theorem is also discussed.

Sufficiency in multiobjective subset programming involving generalized type-I functions

In this paper, sufficient optimality conditions for a multiobjective subset programming problem are established under generalized

Higher-Order Duality in Nondifferentiable Minimax Programming with Generalized Type I Functions

(\mathcal{F}, \alpha, \rho, d)

SUFFICIENCY IN NONSMOOTH MULTIOBJECTIVE FRACTIONAL PROGRAMMING

-type-I functions.