Target level method in linear multi-criteria problems

DOI10.1023/A:1022911724551MaRDI QIDQ1395064zbMATH OpenOpenAlexFDO

Authors S. Yu. Churkina, Yu. D. Zabrodin

Publication date 26 June 2003

Published in Computational Mathematics and Modeling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1022911724551

zbMATH Keywords

efficient setlinear multi-criteria maximization problems

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Review text

We consider the target level method for solving linear multi-criteria maximization problems. The method finds an efficient (Pareto-optimal) vector estimate that is closest in the Chebyshev metric to the target level point specified by the decision maker. The proposed method describes (parametrizes and approximates) the efficient set. In the linear case the number of scalar optimization problems needed to describe the set of efficient vector estimates is substantially reduced. A formula is derived which, under certain conditions, can be used to compute efficient vector estimates without solving any optimization problems. An algorithm based on these results is proposed for two-criteria problems.

Recommendations

• Search for efficient solutions of multi-criteria problems by target-level method
• scientific article; zbMATH DE number 1149803
• scientific article; zbMATH DE number 3982934
• scientific article; zbMATH DE number 4061017
• scientific article; zbMATH DE number 3982928

Cited in

(3)

• Search for efficient solutions of multi-criteria problems by target-level method
• scientific article; zbMATH DE number 2099507 (Why is no real title available?)
• scientific article; zbMATH DE number 842015 (Why is no real title available?)

This page was built for publication: Target level method in linear multi-criteria problems

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