Conditions of solvability of vector problems using linear convolution of criteria

DOI10.1007/BF02667917MaRDI QIDQ1968512zbMATH OpenOpenAlexFDO

Authors M. K. Kravtsov, O. A. Yanushkevich, Eberhard Girlich, Michail M. Kovalev

Publication date 6 June 2000

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

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

zbMATH Keywords

LCC scalarizationlinear convolution of criteriavector minimum problems

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Multi-objective and goal programming (90C29)

Review text

The paper is dedicated to vector minimum problems over finite admissible sets. The scalarization of this problem via convex combination of the criteria is called here Linear Convolution of Criteria (LCC). There are examples of vector problems, where there exist Pareto-minima that are not optimal for any LCC scalarized problem. The paper stated a criterion for the solvability of finite vector minimum problems via LCC scalarization. Futher an algorithm is presented for the reduction of so called problems of MINMAX-type and MINMIN-type to an equivalent vector minimum problem solvable using LCC. This scheme covers many well-known problems of optimization on graphs.

Recommendations

• Solvability of the vector problem by the linear criteria convolution algorithm
• Solvability of a class of discrete vector problems by the algorithms of linear convolution of criteria
• Problems of discrete vector optimization on systems of subsets which cannot be solved using a linear convolution algorithm
• Unsolvability of vector discrete optimization problems in the class of algorithms of linear convolution of criteria
• scientific article; zbMATH DE number 2107064

Cites work

• Complexity of discrete multicriteria problems
• Conditions for Pareto optimality in a discrete vector problem on a system of subsets
• scientific article; zbMATH DE number 3875040 (Why is no real title available?)
• scientific article; zbMATH DE number 3828714 (Why is no real title available?)
• scientific article; zbMATH DE number 3965820 (Why is no real title available?)
• scientific article; zbMATH DE number 4076985 (Why is no real title available?)
• scientific article; zbMATH DE number 4087412 (Why is no real title available?)
• scientific article; zbMATH DE number 3782733 (Why is no real title available?)
• scientific article; zbMATH DE number 803941 (Why is no real title available?)
• Investigation of a linear convolution of criteria in multicriterial discrete programming
• Problems of discrete vector optimization on systems of subsets which cannot be solved using a linear convolution algorithm
• Proper efficiency and the theory of vector maximization

Cited in

(6)

• Solvability of the vector problem by the linear criteria convolution algorithm
• Solvability of a class of discrete vector problems by the algorithms of linear convolution of criteria
• Unsolvability of vector discrete optimization problems in the class of algorithms of linear convolution of criteria
• scientific article; zbMATH DE number 1878085 (Why is no real title available?)
• scientific article; zbMATH DE number 2107064 (Why is no real title available?)
• scientific article; zbMATH DE number 5211144 (Why is no real title available?)

This page was built for publication: Conditions of solvability of vector problems using linear convolution of criteria

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1968512)