Skip to main content
SpringerLink
Log in

Efficiency Conditions and Duality for a Class of Multiobjective Fractional Programming Problems

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

A class of constrained multiobjective fractional programming problems is considered from a viewpoint of the generalized convexity. Some basic concepts about the generalized convexity of functions, including a unified formulation of generalized convexity, are presented. Based upon the concept of the generalized convexity, efficiency conditions and duality for a class of multiobjective fractional programming problems are obtained. For three types of duals of the multiobjective fractional programming problem, the corresponding duality theorems are also established.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aghezzaf, B. and Hachimi, M. (2000), Generalized convexity and duality in multiobjective programming problems, Journal of Global Optimization 18, 91–101.

    Google Scholar 

  2. Aghezzaf, B. and Hachimi, M. (2001), Sufficiency and duality in multiobjective programming involving generalized (F, ρ)-convexity, Journal of Mathematical Analysis and Applications 258, 617–628.

    Google Scholar 

  3. Avriel, M., Diewert, W. E., Schaible, S. and Zang, I. (1988), Generalized Concaveity, Plenum Press, New York, NY.

    Google Scholar 

  4. Bector, C. R. (1973), Duality in nonlinear fractional programming, Zeitschrift für Operations Research 17, 183–193.

    Google Scholar 

  5. Craven, B. D. (1988), Fractional Programming, Heldermann Verlag, Berlin.

    Google Scholar 

  6. Hanson, M. A. (1981), On sufficiency of the Kuhn–Tucker conditions, Journal of Mathematical Analysis and Applications 80, 544–550.

    Google Scholar 

  7. Jeyakumar, V. (1985), Strong and weak invexity in mathematical programming, Methods of Operations Research 55, 109–125.

    Google Scholar 

  8. Jeyakumar, V. and Mond, B. (1992), On generalized convex mathematical programming, Journal of the Australian Mathematical Society, Series. B, 34, 43–53.

    Google Scholar 

  9. Kaul, R. N., Suneja, S. K., and Srivastava, M. K. (1994), Optimality criteria and duality in multiple-objective optimization involving generalized invexity, Journal of Optimization Theory and Applications 80(3), 465–482.

    Google Scholar 

  10. Khan, Z. and Hanson, M. A. (1997), On ratio invexity in mathematical programming, Journal of Mathematical Analysis and Applications 205, 330–336.

    Google Scholar 

  11. Li, Z. (1993), Duality theorems for a class of generalized convex multiobjective programming problems, Acta Scientiarum Naturalium Universitatis NeiMongol 24(2), 113–118.

    Google Scholar 

  12. Liang, Z. A., Huang, H. X. and Pardalos, P. M. (2001), Optimality conditions and duality for a class of nonlinear fractional programming problems, Journal of Optimization Theory and Applications 110(3), 611–619.

    Google Scholar 

  13. Liang, Z. and Ye, Q. (2001), Duality for a class of multiobjective control problems with generalized invexity, Journal of Mathematical Analysis and Applications 256, 446–461.

    Google Scholar 

  14. Maeda, T. (1994), Constraint qualifications in multiobjective optimization problems: differentiable case, Journal of Optimization Theory and Applications 80(3), 483–500.

    Google Scholar 

  15. Mangasarian, O. L. (1969), Nonlinear Programming, McGraw-Hill, New York.

    Google Scholar 

  16. Miettinen, K.M. (1999), Nonlinear Multiobjective Optimization, Kluwer Academic Publishers, Dordrecht, The Netherlands.

    Google Scholar 

  17. Mond, B. and Weir, T. (1981), Generalized concavity and duality. In: Schaible, S. and Ziemba, W. T. (eds.), Generalized Convexity in Optimization and Economics, Academic Press, New York, NY, pp. 263–280.

    Google Scholar 

  18. Mond, B. and Weir, T. (1982), Duality for fractional programming with generalized convexity conditions, Journal of Information and Optimization Sciences 3(2), 105–124.

    Google Scholar 

  19. Mukherjee, R. N. and Rao, C. P. (2000), Mixed type duality for multiobjective variational problems, Journal of Mathematical Analysis and Applications 252, 571–586.

    Google Scholar 

  20. Preda, V. (1992), On efficiency and duality for multiobjective programs, Journal of Mathematical Analysis and Applications, 166, 365–377.

    Google Scholar 

  21. Reddy, L. V. and Mukherjee, R. N. (1999), Some results on mathematical programming with generalized ratio invexity, Journal of Mathematical Analysis and Applications 240, 299–310.

    Google Scholar 

  22. Schaible, S. (1976), Duality in fractional proramming: a unified approach, Operations Research 24, 452–461.

    Google Scholar 

  23. Schaible, S. (1976), Fractional programming, I: Duality, Management Science 22, 858–867.

    Google Scholar 

  24. Schaible, S. (1981), Fractional programming: applications and algorithms, European Journal of Operational Research 7, 111–120.

    Google Scholar 

  25. Schaible, S. (1995), Fractional Programming. In: Horst, R. and Pardalos, P. M. (eds.), Handbook of Global Optimization, Kluwer Academic Publishers, Dordrecht, The Netherlands, pp. 495–608.

    Google Scholar 

  26. Schaible, S. and Ibaraki, T. (1983), Fractional programming, European Journal of Operational Research 12, 325–338.

    Google Scholar 

  27. Stancu-Minasian, I. M. (1997), Fractional Programming: Theory, Methods and Applications, Kluwer Academic Publishers, Dordrecht, The Netherlands.

    Google Scholar 

  28. Stancu-Minasian, I. M. (1999), A fifth bibliograpy of fractional programming, Optimization 45, 343–367.

    Google Scholar 

  29. Wolfe, P. (1961), A duality theorem for nonlinear programming, Quarterly of Applied Mathematics 19, 239–244.

    Google Scholar 

  30. Xu, Z. (1996), Mixed type duality in multiobjective programming problems, Journal of Mathematical Analysis and Applications 198, 621–635.

    Google Scholar 

  31. Yang, X. M., Teo, K. L. and Yang, X. Q. (2000), Duality for a class of nondifferentiable multiobjective programming problems, Journal of Mathematical Analysis and Applications 252, 999–1005.

    Google Scholar 

  32. Zhang, Z. and Mond, B. (1997), Duality for a nondifferentiable programming problem, Bulletin of the Australian Mathematical Society 55, 29–44.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, Shanghai University of Finance and Economics, Shanghai, 200433, P.R. China

    Zhi-An Liang

  2. Department of Mathematical Sciences, Tsinghua University, Beijing, 100084, P.R. China

    Hong-Xuan Huang

  3. Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611, USA

    Panos M. Pardalos

Authors
  1. Zhi-An Liang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hong-Xuan Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Panos M. Pardalos
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liang, ZA., Huang, HX. & Pardalos, P.M. Efficiency Conditions and Duality for a Class of Multiobjective Fractional Programming Problems. Journal of Global Optimization 27, 447–471 (2003). https://doi.org/10.1023/A:1026041403408

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1026041403408

Search

Navigation