Buradasınız

Higher-order (F,alpha,beta,rho,d)-Convexity and its Application in Fractional Programming

Journal Name:

Publication Year:

AMS Codes:

Abstract (2. Language): 
In this paper we introduce the concept of higher-order (F, , ,, d)-convexity with respect to a differentiable 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 duals of (NP) have also been discussed. These duality results are then applied to nonlinear fractional programming problems.
266-275

REFERENCES

References: 

[1] I. Ahmad and Z. Husain. Second-order (F,,, d)-convexity and Duality in Multiobjective
Programming. Information Sciences, 176 : 3094-3103, 2006.
[2] M. A. Hanson. On Sufficiency of the Kuhn-Tucker Conditions. Journal of Mathematical
Analysis and Applications, 80 : 545-550, 1981.
[3] M. A. Hanson and B. Mond. Further Generalizations of Convexity in Mathematical Programming.
Journal of Information and Optimization Sciences, 3 : 25-32, 1986.
[4] Z. A. Liang, H. X. Huang and P. M. Pardalos. Optimality Conditions and Duality for a
Class of Nonlinear Fractional Programming Problems. Journal of Optimization Theory
and Applications, 110 : 611-619, 2001.
[5] O. L. Mangasarian. Nonlinear Programming. McGraw Hill, New York, NY, 1969.
[6] S. Pandey. Duality for Multiobjective Fractional Programming involving Generalized -
bonvex Functions. Opsearch, 28 : 31-43, 1991.
[7] V. Preda. On Efficiency and Duality for Multiobjective Programs. Journal of Mathematical
Analysis and Applications, 166 : 365-377, 1992.
[8] J. P. Vial. Strong and Weak Convexity of Sets and Functions. Mathematics of Operations
Research, 8 : 231-259, 1983.
[9] D. H. Yuan, X. L. Liu, A. Chinchuluun and P. M. Pardalos. Nondifferentiable Minimax
Fractional Programming Problems with (C,,, d)-Convexity. Journal of Optimization
Theory and Applications, 129 : 185-199, 2006.

Thank you for copying data from http://www.arastirmax.com