Generalized unimodal multicriteria optimization

Authors

  • Liana Lupşa “Babes-Bolyai” University, Cluj-Napoca, Romania
  • Nicolae Popovici “Babes-Bolyai” University, Cluj-Napoca, Romania

Keywords:

generalized unimodal functions, multiple criteria integer programming

Abstract

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

Download data is not yet available.

References

Karmanov, V. G., Programmation mathématique, Editions Mir, Moscou, 1977, https://doi.org/10.1016/0378-4754(82)90605-x

Luc, D. T., Theory of Vector Optimization, Springer-Verlag, Berlin, 1989.

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

2006-02-01

How to Cite

Lupşa, L., & Popovici, N. (2006). Generalized unimodal multicriteria optimization. Rev. Anal. Numér. Théor. Approx., 35(1), 65–70. Retrieved from https://ictp.acad.ro/jnaat/journal/article/view/2006-vol35-no1-art9

Issue

Section

Articles