Higher-Order $(F,\alpha, \beta, \rho, d, E) $-Convexity in Fractional Programming
Received:April 27, 2022  Revised:June 27, 2022
Key Words: $E$-convexity   higher order $(F,\alpha, \beta, \rho,d, E)$-convexity   optimality conditions   duality   fractional programming  
Fund Project:
Author NameAffiliation
Himanshu TIWARI Department of Mathematics, Faculty of Science, University of Rajasthan, Jaipur 302004, India 
Seema MEENA Department of Mathematics, Faculty of Science, University of Rajasthan, Jaipur 302004, India 
Deepak KUMAR Department of Mathematics, Faculty of Science, University of Rajasthan, Jaipur 302004, India 
D. B. OJHA Department of Mathematics, Faculty of Science, University of Rajasthan, Jaipur 302004, India 
Hits: 266
Download times: 234
Abstract:
      In this paper we define higher order $(F,\alpha, \beta, \rho,d, E)$-convex function with respect to $E$-differentiable function $K$ and obtain optimality conditions for nonlinear programming problem (NP) from the concept of higher order $(F,\alpha, \beta, \rho,d)$-convexity. Here, we establish Mond-Weir and Wolfe duality for (NP) and utilize these duality in nonlinear fractional programming problem.
Citation:
DOI:10.3770/j.issn:2095-2651.2023.03.005
View Full Text  View/Add Comment