Skip to main content
Log in

Minimax Programming Under Generalized (p, r)-Invexity

  • Published:
Journal of Systems Science and Complexity Aims and scope Submit manuscript

Abstract

Minimax programming problems involving generalized (p, r)-invex functions are considered. Parametric sufficient optimality conditions and duality results are established under the aforesaid assumptions on the objective and constraint functions.

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. J. M. Danskin, The Theory of Max-Min and its Applications to Weapon Allocation Problem, Springer-Verlag, New York, 1967.

    Google Scholar 

  2. K. L. Chew, Pseudolinear minimax programs, Asia Pacific Journal of Operational Research, 1984, 1(1): 53–64.

    Google Scholar 

  3. S. K. Mishra, Pseudolinear fractional minmax programming, Indian Journal of Pure and Applied Mathematics, 1995, 26: 763–772.

    Google Scholar 

  4. S. Tanimoto, Nondifferentiable mathematical programming and convex-concave functions, Journal of Optimization Theory and Applications, 1980, 31: 331–342.

    Article  Google Scholar 

  5. B. Mond and T. Weir, Sufficient optimality conditions and duality for pseudoconvex minimax problem, Cahiers, du-Centre d’Etudes, de Recherche Operationnelle, 1991, 33: 123–128.

    Google Scholar 

  6. T. Antczak, Minimax programming under (p, r)-invexity, European Journal of Operational Research, 2004, 158: 1–19.

    Article  Google Scholar 

  7. T. Antczak, Generalized (p, r)-invexity in mathematical programming, Numerical Functional Analysis and Optimization, 2003, 24: 437–453.

    Article  Google Scholar 

  8. M. S. Bazaraa, H. D. Sherali, and C. M. Shetty, Nonlinear Programming: Theory and Algorithms, John Wiley and Sons, New York, 1991.

    Google Scholar 

  9. J. P. Crouzeix, J. A. Ferland, and S. Schaible, An algorithm for generalized fractional programs, Journal of Optimization Theory and Applications, 1985, 47: 35–49.

    Article  Google Scholar 

  10. T. Antczak, (p, r)-Invex sets and functions, Journal of Mathematical Analysis and Applications, 2001, 263: 355–379.

    Article  Google Scholar 

  11. B. Mond and T. Weir, Generalized Concavity and Duality, S. Schaible, W. T. Ziemba (Eds.), Generalized Concavity in Optimization and Economics, Academic Press, New York, 1981, 263–279.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to S. K. Mishra.

Additional information

The research is supported by the Council of Scientific and Industrial Research, New Delhi, National Natural Research Foundation of China, and the Research Grants Council of Hong Kong.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mishra, S.K., Wang, S. & Lai, K.K. Minimax Programming Under Generalized (p, r)-Invexity. Jrl Syst Sci & Complex 20, 501–508 (2007). https://doi.org/10.1007/s11424-007-9047-9

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-007-9047-9

Keywords

Navigation