TARU PUBLICATIONS
Journal of Statistics and Management Systems cover

Journal of Statistics and Management Systems

(Since 1998)
Hybrid ·Peer-reviewed·ISSN (Online): 2169-0014·ISSN (Print): 0972-0510

Indexed in ABDC Australia

Powered by:Powered by

Monthly Journal: Publishes peer-reviewed aticles on theoretical and applied statistics and management systems, expoloring industrial statistics, actuarial and decision sciences.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Taru Online First Current IssueSpecial IssuesBrowse all Issues
Journal of Statistics and Management Systems
Open Access Research Article

Optimality and duality results for minimax optimization problems under E-invexity

* ,

* Corresponding author · click or hover a name for details

pp. 317–335Vol. 28Issue 2March 2025DOI: 10.47974/JSMS-1242XML
Received:
10 May 2023
Published Online:
01 Mar 2025
Article type:
Research Article
Language:
EN
Article no.:
JSMS-1242
Pages:
317–335

Abstract

In this paper, minimax optimization problems involving (not necessarily) differentiable E-invex functions are considered. The sufficient optimality conditions for E-differentiable minimax optimization problems solving E-invex functions are established. To demonstrate the aforementioned results, an example of an E-minimax optimization problem is presented. The parametric and nonparametric Mond-Weir and Wolfe dual problems are formulated for the E-differentiable minimax optimization context. Furthermore, several duality theorems, including weak, strong, converse, and strict converse, are established under the assumptions of E-invexity.

Keywords

E-differentiableE-invexityMinimax optimization problemsSufficient optimalityDuality

Subject Classifications

26B2590C2690C46

References

[1] N. Abdulaleem, “E-optimality conditions for E-differentiable E-invex multiobjective programming problems,” WSEAS Trans. Math., vol. 18, pp. 14-27 (2019).
[2] N. Abdulaleem, “V-E-invexity in E-differentiable multiobjective programming,” Numer. Algebra Control Optim., vol. 12, no. 2, pp. 427-443 (2022).
[3] T. Antczak and N. Abdulaleem, “E-optimality conditions and Wolfe E-duality for E-differentiable vector optimization problems with inequality and equality constraints,” J. Nonlinear Sci. Appl., vol. 12, pp. 745-764 (2019).
[4] T. Antczak, “Minimax programming under (p, r)-invexity,” Eur. J. Oper. Res., vol. 158, pp. 1-19 (2004).
[5] T. Antczak, “Nonsmooth minimax programming under locally Lipschitz (Φ, ρ)-invexity,” J. Appl. Math. Comput. Mech., vol. 217, pp. 9606-9624 (2011).
[6] N. Abdulaleem, “E-duality results for E-differentiable E-invex multiobjective programming problems,” J. Phys.: Conf. Ser., vol. 1294, no. 3, p. 032027, IOP Publishing (2019).
[7] T. Antczak, “A lower bound for the penalty parameter in the exact minimax penalty function method for solving nondifferentiable extremum problems,” J. Optim. Theory Appl., vol. 159, no. 2, pp. 437-453 (2013).
[8] T. Antczak and N. Abdulaleem, “E-differentiable minimax programming under E-convexity,” Ann. Oper. Res., vol. 300, no. 1, pp. 1-22 (2021).
[9] N. Abdulaleem, “E-invexity and generalized E-invexity in E-differentiable multiobjective programming,” ITM Web Conf., vol. 24, p. 01002, EDP Sciences (2019).
[10] N. Abdulaleem, “E-univex sets, E-univex functions and E-differentiable E-univex programming,” Results Math., vol. 78, no. 1, pp. 1-22 (2023).
[11] N. Abdulaleem, “Optimality and duality for E-differentiable multiobjective programming problems involving E-type I functions,” J. Ind. Manag. Optim., vol. 19, no. 2, pp. 1513-1527 (2023).
[12] N. Abdulaleem, “Wolfe E-duality for E-differentiable E-invex vector optimization problems with inequality and equality constraints,” in Proc. 2018 Int. Conf. Appl. Math. Comput. Sci. (ICAMCS.NET), IEEE, pp. 156-1567 (2018).
[13] I. Ahmad, Z. Husain, and S. Sharma, “Second-order duality in nondifferentiable minmax programming involving type-I functions,” J. Comput. Appl. Math., vol. 215, no. 1, pp. 91-102 (2008).
[14] C. R. Bector and B. L. Bhatia, “Sufficient optimality conditions and duality for a minimax problem,” Util. Math., vol. 27, pp. 229-247 (1985).
[15] C. R. Bector, S. Chandra, and I. Husain, “Sufficient conditions and duality for a continuous-time minmax programming problem,” Asia-Pac. J. Oper. Res., vol. 9, pp. 55-76 (1992).
[16] C. R. Bector, S. Chandra, and V. Kumar, “Duality for minmax programming involving V-invex functions,” Optimization, vol. 30, pp. 93-103 (1994).
[17] K. L. Chew, “Pseudolinear minimax programs,” Asia-Pac. J. Oper. Res., pp. 53-64 (1984).
[18] T. D. Chuong, “Nondifferentiable minimax programming problems with applications,” Ann. Oper. Res., vol. 251, no. 2, pp. 73-87 (2017).
[19] E. Cherkaev and A. Cherkaev, “Minimax optimization problem of structural design,” Comput. Struct., vol. 86, no. 14, pp. 1426-1435 (2008).
[20] R. Cambini and L. Carosi, “A note on scalar ‘generalized’ invexity,” J. Inf. Optim. Sci., vol. 40, no. 3, pp. 615-632 (2019).
[21] J. M. Danskin, The theory of max-min and its application to weapons allocation problems, Springer-Verlag, New York (1967).
[22] V. F. Demyanov and V. N. Malozehon, Introduction to minmax, John Wiley & Sons, New York, Toronto (1974).
[23] D. Z. Du and P. M. Pardalos, Eds., Minimax and applications, Kluwer Academic Publishers, Dordrecht (1995).
[24] X. T. Deng, Z. F. Li, and S. Y. Wang, “A minimax portfolio selection strategy with equilibrium,” Eur. J. Oper. Res., vol. 166, pp. 278-292 (2005).
[25] Z. Husain, A. Jayswal, and I. Ahmad, “Second order duality for nondifferentiable minimax programming problems with generalized convexity,” J. Global Optim., vol. 44, no. 4, pp. 593-608 (2009).
[26] A. Iqbal, S. Ali, and I. Ahmad, “On geodesic E-convex sets, geodesic E-convex functions and E-epigraphs,” J. Optim. Theory Appl., vol. 155, no. 1, pp. 239-251 (2012).
[27] A. Jayswal and I. Stancu-Minasian, “Higher-order duality for nondifferentiable minimax programming problem with generalized convexity,” Nonlinear Anal., vol. 74, no. 2, pp. 616-625 (2011).
[28] M. A. Khan, “Optimality conditions and duality for nonsmooth minimax programming problems under generalized invexity,” Filomat, vol. 30, pp. 1253-1261 (2016).
[29] N. Kailey and V. Sharma, “On second order duality of minimax fractional programming with square root term involving generalized B–(p, r)-invex functions,” Ann. Oper. Res., vol. 244, no. 2, pp. 603-617 (2016).
[30] A. Kiliçman and W. Saleh, “On geodesic strongly E-convex sets and geodesic strongly E-convex functions,” J. Inequal. Appl., vol. 2015, no. 1, pp. 1-10 (2015).
[31] A. Kiliçman and W. Saleh, “On properties of geodesic semilocal E-preinvex functions,” J. Inequal. Appl., vol. 2018, no. 1, pp. 1-13 (2018).
[32] H. C. Lai and T. Y. Huang, “Optimality conditions for a nondifferentiable minimax programming in complex spaces,” Nonlinear Anal., vol. 71, no. 4, pp. 1205-1212 (2009).
[33] X. Liu, D. Yuan, and D. Qu, “Minimax programming with (G, α)-invexity,” J. Nonlinear Anal. Optim., vol. 4, pp. 173-180 (2013).
[34] A. Mehra and D. Bhatia, “Optimality and duality for minmax problems involving arcwise connected and generalized arcwise connected functions,” J. Math. Anal. Appl., vol. 231, pp. 425-445 (1999).
[35] S. K. Mishra and K. Shukla, “Nonsmooth minimax programming problems with V-r-invex functions,” Optimization, vol. 59, no. 1, pp. 95-103, 2010.
[36] S. K. Mishra, S. Wang, and K. K. Lai, “Minimax programming under generalized (p, r)-invexity,” J. Sys. Sc. Complex., vol. 20, pp. 501-508 (2007).
[37] B. Mond and T. S. Weir, “Sufficient optimality conditions and duality for pseudoconvex minimax problem,” Cahiers du Centre d’Études de Recherche Opérationnelle, vol. 33, pp. 123-128 (1991).
[38] A. A. Megahed, H. G. Gomma, E. A. Youness, and A. H. El-Banna, “Optimality conditions of E-convex programming for an E-differentiable function,” J. Inequal. Appl., vol. 2013, no. 1, Art. ID: 246 (2013).
[39] S. Rivaz and M. A. Yaghoobi, “Minimax regret solution to multiobjective linear programming problems with interval objective functions coefficients,” Cent. Eur. J. Oper. Res., vol. 21, no. 3, pp. 625-649 (2013).
[40] M. V. Stefanescu and A. Stefanescu, “Minimax programming under new invexity assumptions,” Revue Roumaine de Mathématiques Pures et Appliquées, vol. 52, pp. 367-376 (2007).
[41] Y. R. Syau and E. S. Lee, “Some properties of E-convex functions,” Appl. Math. Lett., vol. 18, no. 9, pp. 1074-1080 (2005).
[42] S. Treanţă and S. Mititelu, “Duality with (ρ, b)-quasiinvexity for multidimensional vector fractional control problems,” J. Inf. Optim. Sci., vol. 40, no. 7, pp. 1429-1445 (2019).
[43] P. P. Wang, T. Zhu, and T. S. Du, “Some inequalities using s-preinvexity via quantum calculus,” Journal of Interdisciplinary Mathematics, vol. 24, no. 3, pp. 613-636 (2021).
[44] T. Weir, “Pseudoconvex minmax programming,” Util. Math., vol. 42, pp. 234-240 (1992).
[45] S. Y. Wang, Y. Yamamoto, and M. Yu, “A minimax rule for portfolio selection in frictional markets,” Math. Methods Oper. Res., vol. 57, pp. 141-155 (2003).
[46] E. A. Youness, “E-convex sets, E-convex functions, and E-convex programming,” J. Optim. Theory Appl., vol. 102, no. 2, pp. 439-450, 1999.
[47] G. J. Zalmai, “Optimality criteria and duality for a class of minmax programming problems with generalized invexity conditions,” Util. Math., vol. 32, pp. 35-57 (1987).
[48] G. J. Zalmai, “Parameter-free sufficient optimality conditions and duality models for minmax fractional subset programming problems with generalized (F, ρ, θ)-convex functions,” Comput. Math. Appl., vol. 45, pp. 1507-1535 (2003).
[49] H. Zhou and W. Sun, “Optimality and duality without a constraint qualification for minimax programming,” Bull. Aust. Math. Soc., vol. 67, pp. 121-130 (2003).

Views: 138Downloads: 60Citations: 0