Abstract
In this paper, we construct a Wolfe and Mond-Weir types dual problem in terms of contingent epiderivatives for nonsmooth mathematical programming problems with equilibrium constraints (NMPEC) in real Banach spaces. First, we establish some strong and weak duality theorems for the original problem and its dual problem under suitable assumptions on the pseudo-convexity of objective and constraint functions at the point under consideration. We also impose a regularity condition of the (RC) type to have strong duality theorems using both the contingent epiderivative and the contingent hypoderivative. Second, we provide various types of sufficient optimality conditions for the (NMPEC) problem, where either the objective and constraint functions are pseudo-convex at the point under consideration, or the objective function is strict quasi-convex and the constraint functions are quasi-convex at the point under consideration. Some illustrative examples also provided for our findings.
Similar content being viewed by others
References
Aubin, J.-P.: Contingent derivatives of set-valued maps and existence of solutions to nonlinear inclusions and differential inclusions. In: Nachbin, L. (ed.) Advances in Mathematics Supplementary Studies 7A, pp. 159–229. Academic Press, New York (1981)
Aubin, J.P., Frankowska, H.: Set-Valued Analysis. Birkhauser, Boston (1990)
Bot, R.I., Grad, S.-M.: Wolfe duality and Mond–Weir duality via perturbations. Nonlinear Anal. Theory Methods Appl. 73, 374–384 (2010)
Chuong, T.D.: Optimality conditions for nonsmooth multiobjective bilevel optimization problems. Ann. Oper. Res. (2018) (online). https://doi.org/10.1007/s10479-017-2734-6
Dempe, S., Zemkoho, A.B.: Bilevel road pricing: theoretical analysis and optimality conditions. Ann. Oper. Res. 196, 223–240 (2012)
Guu, S.-M., Mishra, S.K., Pandey, Y.: Duality for nonsmooth mathematical programming problems with equilibrium constraints. J. Inequal. Appl. 2016, 28 (2016)
Jahn, J., Khan, A.A.: Some calculus rules for contingent epiderivatives. Optimization 52, 113–125 (2003)
Jahn, J., Khan, A.A.: The existence of contingent epiderivatives for set-valued maps. Appl. Math. Lett. 16, 1179–1185 (2013)
Jahn, J., Rauh, R.: Contingent epiderivatives and set-valued optimization. Math. Methods Oper. Res. 46, 193–211 (1997)
Jayswal, A., Stancu-Minasian, I., Ahmad, I.: On sufficiency and duality for a class of interval-valued programming problems. Appl. Math. Comput. 218, 4119–4127 (2011)
Jayswal, A., Stancu-Minasian, I., Banerjee, J.: Optimality conditions and duality for interval-valued optimization problems using convexificators. Rend Cire Mat Palermo 65, 17–32 (2016)
Jiménez, B., Novo, V.: First order optimality conditions in vector optimization involving stable functions. Optimization 57, 449–471 (2008)
Jiménez, B., Novo, V., Sama, M.: Scalarization and optimality conditions for strict minimizers in multiobjective optimization via contingent epiderivatives. J. Math. Anal. Appl. 352, 788–798 (2009)
López, M.A., Still, G.: Semi-infinite programming. Euro. J. Oper. Res. 180, 491–518 (2007)
Luc, D.T.: Theory of vector optimization. In: Lect. Notes in Eco. and Math. Systems, vol. 319. Springer, Berlin (1989)
Luc, D.T.: Contingent derivatives of set-valued maps and applications to vector optimization. Math. Progr. 50, 99–111 (1991)
Luo, Z.Q., Pang, J.S., Ralph, D.: Mathematical Problems with Equilibrium Constraints. Cambridge University Press, Cambridge (1996)
Luu, D.V., Hang, D.D.: On efficiency conditions for nonsmooth vector equilibrium problems with equilibrium constraints. Numer. Funct. Anal. Optim. 36, 1622–1642 (2015)
Luu, D.V., Mai, T.T.: Optimality and duality in constrained interval-valued optimization, 4OR- Q. J. Oper. Res. 16, 311–327 (2018)
Luu, D.V., Su, T.V.: Contingent derivatives and necessary efficiency conditions for vector equilibrium problems with constraints. RAIRO—Oper. Res. 52, 543–559 (2018)
Mangasarian, O.L.: Nonlinear Programming. McGraw-Hill, New York (1969)
Mishra, S.K., Jayswal, M., An, L.T.M.: Duality for nonsmooth semi-infinite programming problems. Optim. Lett. 6, 261–271 (2012)
Mond, M., Weir, T.: Generallized Concavity and Duality, Generallized Concavity in Optimization and economics. Academic Press, New York (1981)
Movahedian, N., Nabakhtian, S.: Necessary and sufficient conditions for nonsmooth mathematical programs with equilibrium constraints. Nonlinear Anal. 72, 2694–2705 (2010)
Pandey, Y., Mishra, S.K.: Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators. J. Optim. Theory Appl. 17, 694–707 (2016)
Pandey, Y., Mishra, S.K.: Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators Ann. Oper. Res. 269, 549–564 (2018)
Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)
RodrÍguez - MarÍn, L., Sama, M.: About Contingent epiderivatives. J. Math. Anal. Appl. 327, 745–762 (2007)
Rodríguez - Marín, L., Sama, M.: Variational characterization of the contingent epiderivative. J. Math. Anal. Appl. 335, 1374–1382 (2007)
Su, T.V.: Optimality conditions for vector equilibrium problems in terms of contingent epiderivatives. Numer. Funct. Anal. Optim. 37, 640–665 (2016)
Su, T.V.: New optimality conditions for unconstrained vector equilibrium problem in terms of contingent derivatives in Banach spaces, 4OR- Q. J. Oper. Res. 16, 173–198 (2018)
Su, T.V., Hang, D.D.: Duality results for interval-valued pseudoconvex optimization problem with equilibrium constraints with applications. Comput. Appl. Math. 39(127), 1–24 (2020)
Su, T.V., Hang, D.D., Dieu, N.C.: Optimality conditions and duality in terms of convexificators for multiobjective bilevel programming problem with equilibrium constraints. Comput. Appl. Math. 40(37), 1–26 (2021)
Suneja, S.K., Kohli, B.: Optimality and duality results for bilevel programming problem using convexificators. J. Optim. Theory Appl. 150, 1–19 (2011)
Wolfe, P.: A duality theorem for nonlinear programming. Q. J. Appl. Math. 19, 239–244 (1961)
Wu, H.-C.: On interval-valued nonlinear programming problems. J. Math. Anal. Appl. 338, 299–316 (2008)
Ye, J.J.: Necessary and sufficient optimality conditions for mathematical program with equilibrium constraints. J. Math. Anal. Appl. 307, 350–369 (2005)
Acknowledgements
The author would like to express many thanks to the referee and the professor editor-in-chief for careful reading of the manuscript, which improved the paper in its present form.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The author declares that they have no conflict of interest.
Ethical approval
This manuscript does not contain any studies with human participants or animals performed by any of the authors.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Su, T.V. Optimality and duality for nonsmooth mathematical programming problems with equilibrium constraints. J Glob Optim 85, 663–685 (2023). https://doi.org/10.1007/s10898-022-01231-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-022-01231-2