A Convergent Interactive Cutting-Plane Algorithm for Multiobjective Optimization

This paper presents an interactive cutting-plane algorithm for determining a best-compromise solution to a multiobjective optimization problem in situations with an implicitly defined utility function. We derive cutting planes that are based on suitable pairwise trade-offs between the objective functions, as prescribed by the decision maker at each iterate generated by the algorithm. The proposed algorithm requires no line searches, and generates iterates that are all contained in the efficient frontier. This feature facilitates the preference judgment of the decision maker, and permits an analyst to terminate short of optimality with an efficient near-optimal solution. A convergence analysis establishes that any accumulation point generated by the algorithm is a best-compromise solution. We also conduct an error analysis to point out the effect of inconsistencies in trade-off information provided by the decision maker. The algorithm may be extended to situations involving nonconvex feasible regions, as well as nonconcave for a max problem objective functions. We offer remarks for such cases, and describe an application to an urban runoff control-design problem.

[1]  Donald Wehrung,et al.  Interactive Identification and Optimization Using a Binary Preference Relation , 1978, Oper. Res..

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

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

[4]  G. V. Loganathan,et al.  Effects of Urbanization on Frequencies of Overflows and Pollutant Loadings From Storm Sewer Overflows: A Derived Distribution Approach , 1984 .

[5]  C. Hwang Multiple Objective Decision Making - Methods and Applications: A State-of-the-Art Survey , 1979 .

[6]  Simon French,et al.  Multi-Objective Decision Analysis with Engineering and Business Applications , 1983 .

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

[8]  James S. Dyer,et al.  A Time-Sharing Computer Program for the Solution of the Multiple Criteria Problem , 1973 .

[9]  Joseph J. Talavage,et al.  A Tradeoff Cut Approach to Multiple Objective Optimization , 1980, Oper. Res..

[10]  T. L. Saaty A Scaling Method for Priorities in Hierarchical Structures , 1977 .

[11]  Elijah Polak,et al.  Computational methods in optimization , 1971 .

[12]  James S. Dyer,et al.  The Effects of Errors in the Estimation of the Gradient on the Frank-Wolfe Algorithm, with Implications for Interactive Programming , 1974, Oper. Res..

[13]  R. L. Keeney,et al.  Decisions with Multiple Objectives: Preferences and Value Trade-Offs , 1977, IEEE Transactions on Systems, Man, and Cybernetics.

[14]  Kenneth R. Oppenheimer,et al.  A Proxy Approach To Multi-Attribute Decision Making , 1977 .

[15]  Robert Rosenthal,et al.  Computer graphical solutions of constrained minimax location problems , 1980 .

[16]  Yacov Y. Haimes,et al.  Multiobjective Decision Making: Theory and Methodology , 1983 .