Generalized unimodal multicriteria optimization
DOI:
https://doi.org/10.33993/jnaat351-1012Keywords:
generalized unimodal functions, multiple criteria integer programmingAbstract
The aim of this paper is to characterize the sets of weakly-efficient solutions and efficient solutions for multicriteria optimization problem involving generalized unimodal objective functions. An implementable algorithm which completely determines these sets is given for the particular framework of discrete feasible domains.Downloads
References
Karmanov, V. G., Programmation mathématique, Editions Mir, Moscou, 1977, https://doi.org/10.1016/0378-4754(82)90605-x DOI: https://doi.org/10.1016/0378-4754(82)90605-X
Luc, D. T., Theory of Vector Optimization, Springer-Verlag, Berlin, 1989. DOI: https://doi.org/10.1007/978-3-642-50280-4
Lupşa, L. and Blaga, L. R., Optimum points and integer unimodal functions, Automation Computers Applied Mathematics, 13, no. 1, pp. 121-130, 2004.
Malivert, C. and Boissard, N., Structure of efficient sets for strictly quasi-convex objectives, Journal of Convex Analysis, 1, pp. 143-150, 1994.
Popovici, N., Multicriteria optimization with unimodal objective functions, Approximation and Optimization. Proceedings of the International Conference on Approximation and Optimization (Romania)-ICAOR, Cluj-Napoca, July 29-August 1, 1996, vol. 1, pp. 341-344.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2015 Journal of Numerical Analysis and Approximation Theory
This work is licensed under a Creative Commons Attribution 4.0 International License.
Open Access. This article is distributed under the terms of the Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.