论文信息 - An interactive procedure for multiobjective optimization using nash bargaining principle

An interactive procedure for multiobjective optimization using nash bargaining principle

Abstract This paper outlines an interactive procedure for finding a ‘satisfactory’ solution to the multiobjective optimization problems using Nash Bargaining Principle. The concept of ‘measure of conflict’ has been introduced to elicit tradeoffs between the objectives. The suggested procedure has been implemented on a personal computer and its performance has been compared with the GDF procedure reported in the literature.

T. T. Narendran | V. Venugopal

[1] J. Nash. THE BARGAINING PROBLEM , 1950, Classics in Game Theory.

[2] S. Zionts,et al. An Interactive Programming Method for Solving the Multiple Criteria Problem , 1976 .

[3] David Edward Monarchi. An interactive algorithm for multiobjective decision making , 1972 .

[4] John S. Henderson. Marginal Productivity Analysis--A Defect and a Remedy , 1953 .

[5] R. Soland,et al. An interactive branch-and-bound algorithm for multiple criteria optimization , 1986 .

[6] Bernardo Villarreal,et al. An Improved Interactive Multicriteria Integer Programming Algorithm , 1985 .

[7] M. Zeleny. Linear Multiobjective Programming , 1974 .

[8] Mordechai I. Henig,et al. Multiplicative decision rules for multiobjective decision problems , 1986 .

[9] A. Roth. Axiomatic models of bargaining , 1979 .

[10] A. J. Jones. Game theory; mathematical models of conflict. , 1980 .

[11] Sowmyanarayanan Sadagopan,et al. Interactive algorithms for multiple criteria nonlinear programming problems , 1986 .

[12] Arthur M. Geoffrion,et al. An Interactive Approach for Multi-Criterion Optimization, with an Application to the Operation of an Academic Department , 1972 .