Higher-order (F, α, β, ρ, d, E)-convexity in Fractional Programming
Received:April 27, 2022  Revised:May 09, 2022
Key Words: E-convexity, Higher order (F, α, β, ρ, d, E)-convexity, Optimality conditions, Duality, Fractional programming.  
Fund Project:
Author NameAffiliationAddress
HIMANSHU TIWARI UNIVERSITY OF RAJASTHAN Department of Mathematics, University of Rajasthan, Jaipur (302004)
SEEMA MEENA UNIVERSITY OF RAJASTHAN Department of Mathematics, University of Rajasthan, Jaipur (302004)
DEEPAK KUMAR UNIVERSITY OF RAJASTHAN Department of Mathematics, University of Rajasthan, Jaipur (302004)
D. B. OJHA UNIVERSITY OF RAJASTHAN Department of Mathematics, University of Rajasthan, Jaipur (302004)
Hits: 135
Download times: 0
Abstract:
      In this paper we define higher order (F, α, β, ρ, 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, α, β, ρ, d)-convexity. Here, we establish Mond-Weir and Wolfe duality for (NP) and utilize these duality in nonlinear fractional programming problem.
Citation:
DOI:
  View/Add Comment  Download reader