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.
Similar content being viewed by others
References
J. M. Danskin, The Theory of Max-Min and its Applications to Weapon Allocation Problem, Springer-Verlag, New York, 1967.
K. L. Chew, Pseudolinear minimax programs, Asia Pacific Journal of Operational Research, 1984, 1(1): 53–64.
S. K. Mishra, Pseudolinear fractional minmax programming, Indian Journal of Pure and Applied Mathematics, 1995, 26: 763–772.
S. Tanimoto, Nondifferentiable mathematical programming and convex-concave functions, Journal of Optimization Theory and Applications, 1980, 31: 331–342.
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.
T. Antczak, Minimax programming under (p, r)-invexity, European Journal of Operational Research, 2004, 158: 1–19.
T. Antczak, Generalized (p, r)-invexity in mathematical programming, Numerical Functional Analysis and Optimization, 2003, 24: 437–453.
M. S. Bazaraa, H. D. Sherali, and C. M. Shetty, Nonlinear Programming: Theory and Algorithms, John Wiley and Sons, New York, 1991.
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.
T. Antczak, (p, r)-Invex sets and functions, Journal of Mathematical Analysis and Applications, 2001, 263: 355–379.
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.
Author information
Authors and Affiliations
Corresponding author
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
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
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s11424-007-9047-9