Abstract
The modified Tchebycheff method, widely used to generate efficient solutions to a vector optimization problem, provides means to identify properly efficient solutions with a preimposed common bound on all tradeoffs. In this paper, we show how to generate weakly efficient solutions when different bounds are preimposed on the subsets of tradeoffs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
KEENEY, R. L., and RAIFFA, H., Decisions with Multiple Objectives: Preferences and Value Tradeoffs, J. Wiley, New York, New York, 1976.
CHANKONG, V., and HAIMES, Y. Y., Multiobjective Decision Making: Theory and Methodology, North Holland, New York, New York, 1983.
SAWARAGI, Y., NAKAYAMA, H., and TANINO, T., Theory of Multiobjective Optimization, Academic Press, New York, New York, 1985.
SAKAWA, M., and YANO, H., Tradeoff Rates in the Hyperplane Method for Multiple-Objective Optimization, European Journal of Operational Research, Vol. 44, pp. 105–118, 1990.
WIERZBICKI, A. P., Multiple Criteria Solutions in Noncooperative Game Theory, Part 3: Theoretical Foundations, Discussion Paper 288, Kyoto Institute of Economic Research, 1990.
HENIG, M. I., and BUCHANAN, J., Tradeoff Directions in Multiobjective Optimization Problems, Working Paper 52/89, Faculty of Management, Tel Aviv University, 1992.
KALISZEWSKI, I., and MICHALOWSKI, W., Searching for Psychologically Stable Solutions of the Multiple-Criteria Decision Problems, Working Paper 94–11, School of Business, Carleton University, 1994.
KALISZEWSKI, I., Calculating Tradeoffs by Two-Step Parametric Programming, Central European Journal of Operational Research and Economics, Vol. 2, pp. 291–305, 1993.
KALISZEWSKI, I., Qualitative Pareto Analysis by Cone Separation Technique, Kluwer Academic Publishers, Boston, Massachusetts, 1994.
KALISZEWSKI, I., and MICHALOWSKI, W., Generation of Outcomes with Selectively Bounded Tradeoffs, Foundations of Computing and Decision Sciences, Vol. 20, pp. 113–122, 1995.
YU, P. L., Cone Convexity, Cone Extreme Points, and Nondominated Solutions in Decision Problems with Multiobjectives, Journal of Optimization Theory and Applications, Vol. 14, pp. 319–377, 1974.
GEOFFRION, A. M., Proper Efficiency and the Theory of Vector Maximization, Journal of Mathematical Analysis and Applications, Vol. 22, pp. 618–630, 1968.
CHOO, E. U., and ATKINS, D. R., Proper Efficiency in Nonconvex Programming, Mathematics of Operations Research, Vol. 8, pp. 467–470, 1983.
WIERZBICKI, A. P., On the Completeness and Constructiveness of Parametric Characterizations to Vector Optimization Problems, OR Spectrum, Vol. 8, pp. 73–87, 1986.
KALISZEWSKI, I., A Modified Weighted Tchebycheff Metric for Multiple Objective Programming, Computers and Operations Research, Vol. 14, pp. 315–323, 1987.
KALISZEWSKI, I., A Theorem on Nonconvex Functions and Its Application to Vector Optimization, European Journal of Operational Research, Vol. 80, pp. 439–449, 1995.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kaliszewski, I., Michalowski, W. Efficient Solutions and Bounds on Tradeoffs. Journal of Optimization Theory and Applications 94, 381–394 (1997). https://doi.org/10.1023/A:1022687729559
Issue Date:
DOI: https://doi.org/10.1023/A:1022687729559