Abstract
In this paper, we are concerned with a vector reverse convex minimization problem \((\mathcal {P})\). For such a problem, by means of the so-called Fenchel–Lagrange duality, we provide necessary optimality conditions for proper efficiency in the sense of Geoffrion. This duality is used after a decomposition of problem \((\mathcal {P})\) into a family of convex vector minimization subproblems and scalarization of these subproblems. The optimality conditions are expressed in terms of subdifferentials and normal cones in the sense of convex analysis. The obtained results are new in the literature of vector reverse convex programming. Moreover, some of them extend with improvement some similar results given in the literature, from the scalar case to the vectorial one.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Boţ, R.I., Kassay, G., Wanka, G.: Strong duality for generalized convex optimization problems. J. Optim. Theory Appl. 127, 45–70 (2005)
Boţ, R.I., Grad, S. M., Wanka, G.: Fenchel–Lagrange versus geometric duality in convex optimization. J. Optim. Theory Appl. 129, 33–54 (2006)
Boţ, R.I., Wanka, G.: Duality for multiobjective optimization problems with convex objective functions and D.C. constraints. J. Math. Anal. Appl. 315, 526–543 (2006)
Boţ, R.I., Kassay, G., Wanka, G.: Duality for almost convex optimization problems via the perturbation approach. J. Glob. Optim. 42, 385–399 (2008)
Boţ, R.I., Grad, S.-M., Wanka, G.: Duality in Vector Optimization. Springer, Berlin (2009)
Boţ, R.I.: Conjugate Duality in Convex Optimization. Lecture Notes in Economics and Mathematical Systems, vol. 637. Springer, Berlin (2010)
Durier, R.: On locally polyhedral convex functions. In: Hoffmann, K.-H., Zowe, J., Hiriart-Urruty, J.B., Lemarechal, C. (eds.) Trends in Mathematical Optimization. International Series of Numerical Mathematics, vol. 84, pp 55–66. Basel, Birkhäuser (1988)
Fajardo, M.D., Vidal, J.: Stable strong Fenchel and Lagrange duality for evenly convex optimization problems. Optimization 65, 1675–1691 (2016)
Gadhi, N., Metrane, A.: Sufficient optimality condition for vector optimization problems under D.C. data. J. Glob. Optim. 28, 55–66 (2004)
Gadhi, N., Laghdir, M., Metrane, A.: Optimality conditions for D.C vector optimization problems under reverse constraints. J. Glob. Optim. 33, 527–540 (2005)
Geoffrion, A.M.: Proper efficiency and the theory of vector maximization. J. Math. Anal. Appl. 22, 618–630 (1968)
Hiriart-Urruty, J.-B.: Conditions for global optimality 2. J. Glob. Optim. 13, 349–367 (1998)
Martínez-Legaz, J.-E., Volle, M.: Duality in D.C. programming: the case of several D.C. constraints. J. Math. Anal. Appl. 237, 657–671 (1999)
Moreau, J.-J.: Inf-convolution, sous-additivité, convexité des fonctions numériques. J. Math. Pures. Appl. 49, 109–154 (1970)
Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)
Tuy, H.: Convex programs with an additional reverse convex constraint. J. Optim. Theory Appl. 52, 463–486 (1987)
Wanka, G., Boţ, R.I.: On the relations between different dual problems in convex mathematical programming. In: Chamoni, P., Leisten, R., Martin, A., Minnermann, J., Stadtler, H. (eds.) Operations Research Proceedings 2001, pp 255–262. Springer, Berlin (2002)
Acknowledgements
The authors are grateful to the anonymous reviewers for their helpful suggestions and remarks which improved the quality of the paper.
Author information
Authors and Affiliations
Corresponding author
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 (e.g. a society or other partner) 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
Keraoui, H., Aboussoror, A. Necessary Optimality Conditions for Vector Reverse Convex Minimization Problems via a Conjugate Duality. Vietnam J. Math. 52, 265–282 (2024). https://doi.org/10.1007/s10013-022-00602-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10013-022-00602-2