- 期刊
- OpenAccess
Optimality and Duality for Nondifferentiable Minimax Fractional Programming with Generalized Convexity
並列摘要
We establish several sufficient optimality conditions for a class of nondifferentiable minimax fractional programming problems from a view point of generalized convexity. Subsequently, these optimality criteria are utilized as a basis for constructing dual models, and certain duality results have been derived in the framework of generalized convex functions. Our results extend and unify some known results on minimax fractional programming problems.
並列關鍵字
無資料延伸閱讀
- Ahmad, I. (2011). On Second-Order Duality for Minimax Fractional Programming Problems with Generalized Convexity. Abstract and Applied Analysis, (2011), 2223-2237. https://doi.org/10.1155/2011/563924
- Li, G. Q., & Wang, Y. (2014). Global Optimality Conditions for Nonlinear Programming Problems with Linear Equality Constraints. Journal of Applied Mathematics, 2014(), 326-330-129. https://doi.org/10.1155/2014/213178
- Chen, Y. C., & Du, W. S. (2013). New Optimality Conditions for a Nondifferentiable Fractional Semipreinvex Programming Problem. Journal of Applied Mathematics, 2013(), 260-264-429. https://doi.org/10.1155/2013/527183
- Agarwal, R. P., Ahmad, I., Gupta, S. K., & Kailey, N. (2011). Generalized Second-Order Mixed Symmetric Duality in Nondifferentiable Mathematical Programming. Abstract and Applied Analysis, (2011), 36-49. https://doi.org/10.1155/2011/103597
- Zhang, J. K. (2013). Optimality Condition and Wolfe Duality for Invex Interval-Valued Nonlinear Programming Problems. Journal of Applied Mathematics, 2013(), 411-421-548. https://doi.org/10.1155/2013/641345