Abstract
In recent years, many types of interactive optimization methods have been developed in order to support multicriteria decision makings (see the book by Sawaragi, Nakayama and Tanino, 1985 and Wierzbicki and Lewandowski, 1987). Given a feasible decision set X ⊆ R n, and p objective functions, f l, f 2,...,f p (all are assumed to be minimization for convenience), the following problem has been used in various situations of interactive multicriteria decision makings:
where α i and β i are positive and real constants respectively, which are computed based on the information supplied by the decision maker and/or the decision support system. For example, α i and β i are determined from aspiration and reservation levels in the reference point method which is one of the well known methods used in interactive multicriteria decision support systems (see Wierzbicki and Lewandowski, 1987, for the survey of reference point methods).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brucker, P. (1983). Parametric programming and circulation problems with one additional linear constraint. Osnabrücker Schriften zur Mathematik, Reihe P, Heft 56, Fachbereich Mathematik, Universität Osnabrück.
Dekel, E., Nassimi D. and Sahni S. (1981). Parallel matrix and graph algorithms. SIAM J. Comput., 10, pp. 657–675.
Fujishige, S. (1986). A capacity-rounding algorithm for the minimum-cost circulation problem: a dual framework of the Tardos algorithm. Mathematical Programming, 35, pp. 298–308.
Gal, T. (1984). Linear parametric programming — a brief survey. Mathematical Programming Study, 21, pp. 43–68.
Galil, Z. and Tardos E. (1986). An 0(n2(m n log n) log n) min-cost flow algorithm. Proceedings of 27th Annual IEEE Symposium on Foundations of Computer Science, pp. 1–9.
Katoh, N. (1987). An efficient algorithm for bicriteria minimum-cost circulation problem. Working paper WP-87–98, IIASA, Laxenburg, Austria.
KOera, L. (1982). Parallel computation and conflicts in memory access. Information Processing Letters, 14, pp. 93–96.
Megiddo, N. (1979). Combinatorial optimization with rational objective functions. Math. Oper. Res., 4, pp. 414–424.
Megiddo, N. (1983). Applying parallel computation algorithm in the design of serial algorithms. J. ACM, 30, pp. 852–865.
Orlin, J.B. (1984). Genuinely polynomial simplex and non-simplex algorithm for the minimum cost flow problem. Working Paper No. 1615–84, A.P. Sloan School of Management, MIT, December.
Sawaragi, Y., Nakayama, H. and Tanino, T. (1985). Theory of multiobjective optimization. Academic Press, New York.
Steuer, R.E. and Choo, E.V. (1983). An interactive weighted Chebyshev procedure for multiple objective programming. Mathematical Programming, 26, pp. 326–344.
Tardos, E. (1985). A strongly polynomial minimum cost circulation algorithm. Combinatorica, 5, pp. 247–255.
Tardos, E. (1986). A strongly polynomial algorithm to solve combinatorial linear programs. Operations Research, 34 (2), pp. 250–256.
Wierzbicki, A.P. and Lewandowski, A. (1987). Dynamic interactive decision analysis and support. Working paper, IIASA, Laxenburg, Austria.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Katoh, N. (1989). Algorithms for Bicriteria Combinatorial Optimization Problems. In: Lewandowski, A., Stanchev, I. (eds) Methodology and Software for Interactive Decision Support. Lecture Notes in Economics and Mathematical Systems, vol 337. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-22160-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-662-22160-0_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51572-2
Online ISBN: 978-3-662-22160-0
eBook Packages: Springer Book Archive