Lexicographic optima in the multicriteria discrete optimization problem

DOI10.1007/BF02304769MaRDI QIDQ1916633zbMATH OpenFDO

Authors M. K. Kravtsov, O. A. Yanushkevich, V. A. Emelichev

Publication date 12 August 1996

Published in Mathematical Notes (Search for Journal in Brave)

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

zbMATH Keywords

lexicographic optimumlinear convolution of criteriavector optimization

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1353833
• Lexicographic-lexicographical optimization problems with alternative criteria
• Some problems of lexicographical optimization with alternative criteria.
• scientific article; zbMATH DE number 6123175
• Existence of solutions and solving method of lexicographic problem of convex optimization with the linear criteria functions

Cites work

• scientific article; zbMATH DE number 3875040 (Why is no real title available?)
• scientific article; zbMATH DE number 4076985 (Why is no real title available?)
• scientific article; zbMATH DE number 4093169 (Why is no real title available?)
• scientific article; zbMATH DE number 4099071 (Why is no real title available?)
• scientific article; zbMATH DE number 4112386 (Why is no real title available?)
• scientific article; zbMATH DE number 3715322 (Why is no real title available?)
• scientific article; zbMATH DE number 26845 (Why is no real title available?)
• scientific article; zbMATH DE number 3564689 (Why is no real title available?)
• scientific article; zbMATH DE number 803941 (Why is no real title available?)
• Lexicographic bottleneck problems
• Solution of combinatorial optimization problems with minimax criterion

Cited in

(23)

• Lexicographical order and duality in multiobjective programming
• Lexicographic optimality in the multiple objective linear programming: The nucleolar solution
• Solvability of the vector problem by the linear criteria convolution algorithm
• Lexicographic improvement of the target values in convex goal programming
• Algorithms for solving lexicographic multicriterion problems on matroids
• Lexicographic optimal solution of the multi-objective programming problem subject to max-product fuzzy relation inequalities
• A lexicographic optimization algorithm
• Lexicographic-lexicographical optimization problems with alternative criteria
• New approaches to solving discrete programming problems on the basis of lexicographic search
• scientific article; zbMATH DE number 5158972 (Why is no real title available?)
• scientific article; zbMATH DE number 5159018 (Why is no real title available?)
• Reduction of the choice in the Pareto convolution of criteria for the solution of lexicographical optimization problems determined by
• On Direct Methods for Lexicographic Min-Max Optimization
• On optimum solutions of the linear problem of lexicographic-lexicographical multicriteria optimization based on weighed sum of criteria of different importance
• scientific article; zbMATH DE number 4023045 (Why is no real title available?)
• scientific article; zbMATH DE number 1241874 (Why is no real title available?)
• scientific article; zbMATH DE number 1353833 (Why is no real title available?)
• Lexicographically Optimal Base of a Submodular System with respect to a Weight Vector
• scientific article; zbMATH DE number 6123175 (Why is no real title available?)
• Some problems of lexicographical optimization with alternative criteria.
• scientific article; zbMATH DE number 1408924 (Why is no real title available?)
• Discrete lexicographic p-bottleneck problems. I.
• Existence of solutions and solving method of lexicographic problem of convex optimization with the linear criteria functions

This page was built for publication: Lexicographic optima in the multicriteria discrete optimization problem

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