Vector linear programming in zero-sum multicriteria matrix games
暂无分享,去创建一个
[1] Heinz Isermann,et al. The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program , 1977 .
[2] J. Nieuwenhuis,et al. Some minimax theorems in vector-valued functions , 1983 .
[3] M. Zeleny. Linear Multiobjective Programming , 1974 .
[4] Mark Gershon,et al. Techniques for multiobjective decision making in systems management , 1986 .
[5] T. Gal. A general method for determining the set of all efficient solutions to a linear vectormaximum problem , 1977 .
[6] Debasish Ghose,et al. A necessary and sufficient condition for Pareto-optimal security strategies in multicriteria matrix games , 1991 .
[7] M. Sakawa,et al. A unified approach for characterizing Pareto optimal solutions of multiobjective optimization problems: The hyperplane method , 1989 .
[8] Yacov Y. Haimes,et al. Multiobjective Decision Making: Theory and Methodology , 1983 .
[9] J. Ecker,et al. Generating all maximal efficient faces for multiple objective linear programs , 1980 .
[10] P. Yu,et al. Domination structures and multicriteria problems in n-person games , 1977 .
[11] R. S. Laundy,et al. Multiple Criteria Optimisation: Theory, Computation and Application , 1989 .
[12] P. Yu,et al. The set of all nondominated solutions in linear cases and a multicriteria simplex method , 1975 .
[13] G. Owen,et al. Game Theory (2nd Ed.). , 1983 .
[14] Debasish Ghose,et al. Solution concepts in two-person multicriteria games , 1989 .
[15] S. Y. Wang,et al. Existence of a pareto equilibrium , 1993 .
[16] H. W. Corley,et al. Games with vector payoffs , 1985 .