Litcius/Paper detail

Higher-order symmetric duality in nondifferentiable multiobjective fractional programming problem over cone contraints

Ramu Dubey, Deepmala, Vishnu Narayan Mishra

2020Statistics Optimization & Information Computing27 citationsDOIOpen Access PDF

Abstract

In this paper, we introduce the definition of higher-order K-(C, α, ρ, d)-convexity/pseudoconvexity over cone and discuss a nontrivial numerical examples for existing such type of functions. The purpose of the paper is to study higher order fractional symmetric duality over arbitrary cones for nondifferentiable Mond-Weir type programs under higher- order K-(C, α, ρ, d)-convexity/pseudoconvexity assumptions. Next, we prove appropriate duality relations under aforesaid assumptions.

Topics & Concepts

Duality (order theory)ConvexityOrder (exchange)MathematicsCone (formal languages)Type (biology)Pure mathematicsApplied mathematicsMathematical analysisAlgorithmGeologyFinanceEconomicsFinancial economicsPaleontologyOptimization and Variational AnalysisOptimization and Mathematical Programming
Higher-order symmetric duality in nondifferentiable multiobjective fractional programming problem over cone contraints | Litcius