Higher-order (F,alpha,beta,rho,d)-Convexity and its Application in Fractional Programming
Keywords:
Higher-order $(F, \alpha, \beta, \rho, d)$-convexity, Sufficiency, Optimality conditions, Duality, Fractional programming.Abstract
In this paper we introduce the concept ofhigher-order $(F,\alpha,\beta,\rho,d)$-convexity with respect to adifferentiable function $K$. Based on this generalized convexity,sufficient optimality conditions for a nonlinear programming problem(NP) are obtained. Duality relations for Mond-Weir and Wolfe dualsof (NP) have also been discussed. These duality results are then applied to nonlinear fractional programming problems.Downloads
Published
2011-08-09
Issue
Section
Operational Research
License
Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.
By agreeing to this statement, you acknowledge that:
- You retain full copyright over your work.
- The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
- This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.
How to Cite
Higher-order (F,alpha,beta,rho,d)-Convexity and its Application in Fractional Programming. (2011). European Journal of Pure and Applied Mathematics, 4(3), 266-275. https://www.ejpam.com/index.php/ejpam/article/view/619