Abstract
We consider the target level method for solving linear multi-criterion 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-criterion problems.
Similar content being viewed by others
REFERENCES
Yu. B. Germeier, Introduction to Operations Research Theory [in Russian], Nauka, Moscow (1971).
A. Charnes and W. W. Cooper, Management Models and Industrial Applications of Linear Programming, Wiley, New York (1961).
V. V. Podinovskii and V. D. Nogin, Pareto-Optimal Solutions of Multi-Criterion Problems [in Russian], Nauka, Moscow (1982).
R. Stoier, Multi-Criterion Optimization. Theory, Computations, and Applications [Russian translation], Radio i Svyaz', Moscow (1992).
K. Miettinen, Nonlinear Multiobjective Optimization, Kluwer, Boston (1999).
S. Yu. Churkina, “Finding efficient solutions of multi-criterion problem by the target-level method,” Prikl. Mat. Informatika, Moscow State University, No. 7, 127-135 (2001).
A. A. Wierzbicki, “Mathematical basis for satisficing decision making,” Mathem. Modelling,3, No. 5, 391-405 (1982).
M. M. Smirnov, Methods for Approximating Pareto Sets Based on Inverse Logical Scalarization and Their Use in Network Optimization [in Russian], Candidate's Degree Thesis (Physics and Mathematics), MGU, Moscow (1996).
Rights and permissions
About this article
Cite this article
Churkina, S.Y., Zabrodin, Y.D. Target Level Method in Linear Multi-Criterion Problems. Computational Mathematics and Modeling 14, 173–182 (2003). https://doi.org/10.1023/A:1022911724551
Issue Date:
DOI: https://doi.org/10.1023/A:1022911724551