Pareto Efficiency Criteria and Duality for Multiobjective Fractional Programming Problems with Equilibrium Constraints on Hadamard Manifolds

Abstract

This article deals with multiobjective fractional programming problems with equilibrium constraints in the setting of Hadamard manifolds (abbreviated as MFPPEC). The generalized Guignard constraint qualification (abbreviated as GGCQ) for MFPPEC is presented. Furthermore, the Karush–Kuhn–Tucker (abbreviated as KKT) type necessary criteria of Pareto efficiency for MFPPEC are derived using GGCQ. Sufficient criteria of Pareto efficiency for MFPPEC are deduced under some geodesic convexity hypotheses. Subsequently, Mond–Weir and Wolfe type dual models related to MFPPEC are formulated. The weak, strong, and strict converse duality results are derived relating MFPPEC and the respective dual models. Suitable nontrivial examples have been furnished to demonstrate the significance of the results established in this article. The results derived in the article extend and generalize several notable results previously existing in the literature. To the best of our knowledge, optimality conditions and duality for MFPPEC have not yet been studied in the framework of manifolds.

Keywords

• fractional programming
• optimality conditions
• duality
• Hadamard manifolds