Skip to main content
Log in

Optimality conditions and duality for nondifferentiable multiobjective fractional programming with generalized convexity

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

In this paper, we consider nondifferentiable multiobjective fractional programming problems. A concept of generalized convexity, which is called (C,α,ρ,d)-convexity, is first discussed. Based on this generalized convexity, we obtain efficiency conditions for multiobjective fractional programming (MFP). Furthermore, we establish duality results for three types of dual problems of (MFP) and present the corresponding duality theorems.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Bector, C. R., & Bhatia, B. L. (1985). Sufficient optimality conditions and duality for a minimax problem. Utilitas Mathematica, 27, 229–247.

    Google Scholar 

  • Bhatia, D., & Jain, P. (1994). Generalized (F,ρ)-convexity and duality for nonsmooth multiobjective programs. Optimization, 31, 153–164.

    Google Scholar 

  • Clarke, F. H. (1983). Optimization and nonsmooth analysis. New York: Wiley.

    Google Scholar 

  • Hiriart-Urruty, J. B. (1978). On optimality conditions in nondifferentiable programming. Mathematical Programming, 14, 73–86.

    Article  Google Scholar 

  • Hachimi, M., & Aghezzaf, B. (2004). Sufficiency and duality in differentiable multiobjective programming involving generalized type I functions. Journal of Mathematical Analysis and Applications, 296, 382–392.

    Article  Google Scholar 

  • Hanson, M. A. (1981). On sufficient of the Kuhn–Tucker conditions. Journal of Mathematical Analysis and Applications, 80, 545–550.

    Article  Google Scholar 

  • Hanson, M. A., & Mond, B. (1987). Necessary and sufficient conditions in constrained optimization. Mathematical Programming, 37, 51–58.

    Article  Google Scholar 

  • Kaul, R. N., & Kaur, S. (1985). Optimality criteria in nonlinear programming involving nonconvex functions. Journal of Mathematical Analysis and Applications, 105, 104–112.

    Article  Google Scholar 

  • Liang, Z. A., & Shi, Z. W. (2003). Optimality conditions and duality for a minimax fractional programming with generalized convexity. Journal of Mathematical Analysis and Applications, 277, 474–488.

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Liang, Z. A., Huang, H. X., & Pardalos, P. M. (2003). Efficiency conditions and duality for a class of multiobjective fractional programming problems. Journal of Global Optimization, 27, 447–471.

    Article  Google Scholar 

  • Mond, B., & Weir, T. (1981). Generalized concavity and duality. In S. Schaible, W. T. Ziemba (Eds.), Generalized convexity in optimization and economics (pp. 263–280). New York: Academic.

    Google Scholar 

  • Pardalos, P. M., Siskos, Y., & Zopounidis, C. (Eds.). (1995). Advances in multicriteria analysis. Netherlands: Kluwer Academic.

    Google Scholar 

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

    Article  Google Scholar 

  • Preda, V., & Chitescu, I. (1999). On constraint qualification in multiobjective optimization problems: semidifferentiable case. Journal of Optimization Theory and Applications, 100, 417–433.

    Article  Google Scholar 

  • Rueda, N. G., & Hanson, M. A. (1988). Optimality criteria in mathematical programming involving generalized invexity. Journal of Mathematical Analysis and Applications, 130, 375–385.

    Article  Google Scholar 

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

    Google Scholar 

  • Schmitendorf, W. E. (1977). Necessary conditions for static minimax problems. Journal of Mathematical Analysis and Applications, 57, 683–693.

    Article  Google Scholar 

  • Vial, J. P. (1982). Strong convexity of sets and functions. Journal of Mathematical Economics, 9, 187–205.

    Article  Google Scholar 

  • Vial, J. P. (1983). Strong and weak convexity of sets and functions. Mathematics of Operations Research, 8, 187–205.

    Article  Google Scholar 

  • Weir, T. (1992). Pseudoconvex minimax programming. Utilitas Mathematica, 27, 35–57.

    Google Scholar 

  • Yuan, D. H., Liu, X. L., Chinchuluun, A., & Pardalos, P. M. (2005). Nondifferentiable minimax fractional programming problems. Journal of Optimization Theory and Applications, forthcoming.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Panos M. Pardalos.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chinchuluun, A., Yuan, D. & Pardalos, P.M. Optimality conditions and duality for nondifferentiable multiobjective fractional programming with generalized convexity. Ann Oper Res 154, 133–147 (2007). https://doi.org/10.1007/s10479-007-0180-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-007-0180-6

Keywords

Navigation