Solvability of the vector problem by the linear criteria convolution algorithm

DOI10.1007/BF02358974zbMath0915.90229OpenAlexW1999983411MaRDI QIDQ1277550

O. A. Yanushkevich, M. K. Kravtsov

Publication date: 1997

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02358974

zbMATH Keywords

multicriteria problemfinite set of vector estimateslinear criteria convolution

Mathematics Subject Classification ID

Integer programming (90C10) Multi-objective and goal programming (90C29)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Problems of discrete vector optimization on systems of subsets which cannot be solved using a linear convolution algorithm
• Lexicographic optima in the multicriteria discrete optimization problem
• Proper efficiency and the theory of vector maximization
• Complexity of discrete multicriteria problems
• On combinatorial vector optimization problems

This page was built for publication: Solvability of the vector problem by the linear criteria convolution algorithm