Skip to main content
Log in

Duality For Nonsmooth Multiobjective Fractional Programs Under Generalized (F, ρ)-Convexity

  • Theoretical Papers
  • Published:
OPSEARCH Aims and scope Submit manuscript

Abstract

Generalized ( F, ρ )-convexity for nonsmooth functions are used to establish duality results for mutiobjective fractional programs.

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

  1. BECTOR, C.R., BHATIA, D. AND AGGARWAL, S. (1992), ‘Multi objetive fractional programming duality: A nondifferentiable case’, Congressus Numerantium, 87, 77–85.

    Google Scholar 

  2. BECTOR, C.R., SINGH, M. AND GILL, A. (1993), ‘Duality for vector valued B-vex programming’, Asia-Pacific Journal of Operational Research, 10, 15–30.

    Google Scholar 

  3. BHATIA, D. AND DATTA, N. (1985), ‘Necessary conditions and subgradient duality for nondifferentiable and nonconvex multiobjective programming problem’, Cahiers du CERO, 27, 131–140.

    Google Scholar 

  4. BHATIA, D. AND BUDHRAJA, R.K. (1990), ‘On a class of fractional functional programming problems’, Opsearch, 27, No. 4, 225–238.

    Google Scholar 

  5. BHATIA, D. AND PANDEY, S. (1991), ‘Subgradient duality and duality for multiobjective fractional programming involving invex functions’, Cahiers du CERO, 33, No. 2-3. 2–15.

    Google Scholar 

  6. BHATIA, D. AND AGGARWAL, S. (1992), ‘Optimality and duality for multiobjective nonsmooth programming’, European Journal of Operational Research, 57, 360–367.

    Article  Google Scholar 

  7. BHATIA, D. AND JAIN, P. (1994), ‘Generalized (F, ρ)-convexity and duality for nonsmooth multiobjective programs’, Optimization, 31, 153–164.

    Article  Google Scholar 

  8. BUDHRAJA, R.K. (1992), ‘A fractional multiobjective programming problem’, International Journal of Management and Systems, 8, No. 3, 221–231.

    Google Scholar 

  9. CLARKE, F.H. (1983), ‘Optimization and nonsmooth analysis’, Wiley-lnterscience, New York.

    Google Scholar 

  10. GULATI, T.R. AND TALAAT, N. (1991), ‘Sufficiency and duality in nondifferentiable multiobjective programming’, Opsearch, 28, No. 2, 73–87.

    Google Scholar 

  11. JEYAKUMAR, V. AND MOND, B. (1992), ‘On generalised convex Mathematical programming’, Journal of Australian Mathematical Society, Series B. 34, 43–53.

    Article  Google Scholar 

  12. LAI, H.C. AND HO, C.P. (1986), ‘Duality theorem of nondifferentiable convex multiobjective programming’, Journal of Optimization Theory and Applications, 50, No. 3, 407–420.

    Article  Google Scholar 

  13. PREDA, V. (1992), ‘On efficiency and duality for multiobjective programs’, Journal of Mathematical Analysis and Applications, 166, 365–377.

    Article  Google Scholar 

  14. WEIR, T. (1989), ‘On duality in multiobjective fractional programming’, Opsearch, 26, 151–158.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bhatia, D., Budhraja, R.K. & Kumar, N. Duality For Nonsmooth Multiobjective Fractional Programs Under Generalized (F, ρ)-Convexity. OPSEARCH 35, 115–126 (1998). https://doi.org/10.1007/BF03398544

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03398544

Navigation