Pareto-optimality conditions in discrete vector optimization problems
From MaRDI portal
Recommendations
- Conditions of the efficiency of a solution of a discrete vector optimization problem
- scientific article; zbMATH DE number 5172380
- On conditions of efficiency of a solution of a multicriteria discrete problem
- Vector discrete problems: Parametrization of an optimality principle and conditions of solvability in the class of algorithms involving linear convolution of criteria
- Publication:3030600
Cited in
(8)- A linear convolution of criteria in bicriterial optimization.
- Pareto robust optimization on Euclidean vector spaces
- On Pareto and Salukwadze optimization problems.
- Conditions of the efficiency of a solution of a discrete vector optimization problem
- On conditions of efficiency of a solution of a multicriteria discrete problem
- Optimality Conditions for Approximate Pareto Minimality
- Vector discrete problems: Parametrization of an optimality principle and conditions of solvability in the class of algorithms involving linear convolution of criteria
- Criteria for efficiency in vector optimization
This page was built for publication: Pareto-optimality conditions in discrete vector optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4522732)