Skip to main content
Log in

A converse duality theorem on higher-order dual models in nondifferentiable mathematical programming

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

We consider in this paper Mond–Weir type higher-order dual models in nondifferentiable mathematical programming introduced by Mishra and Rueda (2002, J. Math. Anal. Appl. 272, 496–506). We give a converse duality theorem on Mond-Weir type higher-order dual model under mild assumptions.

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. Chandra S., Craven B.D., Mond B.: Generalized concavity and duality with a square root term. Optimization 16, 653–662 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  2. Chen X.: Higher order symmetric duality in non-differentiable multiobjective programming problems. J. Math. Anal. Appl. 290, 423–435 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  3. Hou S.H., Yang X.M.: On second-order symmetric duality in nondifferentiable programming. J. Math. Anal. Appl. 255, 491–498 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  4. Mangasarian O.L.: Second and higher order duality in nonlinear programming. J. Math. Anal. Appl. 51, 607–620 (1975)

    Article  MathSciNet  Google Scholar 

  5. Mangasarian O.L., Fromovitz S.: The Fritz John necessary optimality conditions in the presence of equality and inequality constrains, J. Math. Anal. Appl. 17, 37–47 (1967)

    Article  MATH  MathSciNet  Google Scholar 

  6. Mond B.: A class of nondifferentiable mathematical programming. J. Math. Anal. Appl. 46, 169–174 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  7. Mond B., Zhang J.: Higher order invexity and duality in mathematical programming. In: Crouzeix, J.P. (eds) Generalized Convexity, Generalized Monotonicity: Recent Results, pp. 357–372. Kluwer Academic, Dordrecht/Norwell (1998)

    Chapter  Google Scholar 

  8. Mishra S.K.: Non-differentiable higher order symmetric duality in mathematical programming with generalized invexity. Eur. J. Oper. Res. 167, 28–34 (2005)

    Article  MATH  Google Scholar 

  9. Mishra S.K., Rueda N.G.: Higher-order generalized invexity and duality in nondifferentiable mathematical programming. J. Math. Anal. Appl. 272, 496–506 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  10. Yang X.M., Teo K.L., Yang X.Q.: Higher order generalized convexity and duality in nondifferentiable multiobjective mathematical programming. J. Math. Anal. Appl. 297, 48–55 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  11. Yang X.M., Yang X.Q., Teo K.L.: Nondifferentiable second order symmetric duality in mathematical programming with F-convexity. Eur. J. Oper. Res. 144, 554–559 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  12. Yang X.M., Yang X.Q., Teo K.L., Hou S.H.: Second order symmetric duality in nondifferentiable multiobjective programming with F -convexity. Eur. J. Oper. Res. 164, 406–416 (2005)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to X. M. Yang.

Additional information

This research was partially supported by the National Natural Science Foundation of China (No. 10831009 and 10771228) and The Natural Science Foundation of Chongqing.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yang, X.M., Teo, K.L. A converse duality theorem on higher-order dual models in nondifferentiable mathematical programming. Optim Lett 6, 11–15 (2012). https://doi.org/10.1007/s11590-010-0247-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-010-0247-1

Keywords

Navigation