Multiple objective programming with piecewise linear functions
作者： Stefan Nickel , Margaret M. Wiecek
DOI: 10.1002/1099-1360(199911)8:6<322::AID-MCDA260>3.0.CO;2-5
关键词:
摘要: An approach to generating all efficient solutions of multiple objective programs with piecewise linear functions and constraints is presented. The based on the decomposition feasible set into subsets, referred as cells, so that original problem reduces a series lenear over cells. concepts cell-efficiency complex-efficiency are introduced their relationship efficiency examined. A generic algorithm for finding efficent proposed. Applications in location theory well worst case analysis highlighted.
uni-kl.de参考文章(21)
M. Ehrgott, H. W. Hamacher, K. Klamroth, S. Nickel, A. Schöbel, M. M. Wiecek, Equivalence of Balance Points and Pareto Solutions in Multiple-Objective Programming Journal of Optimization Theory and Applications. ,vol. 92, pp. 209- 212 ,(1997) , 10.1023/A:1022600416297
Malgorzata M. Wiecek, Hong Zhang, A Parallel Algorithm for Multiple Objective Linear Programs Computational Optimization and Applications. ,vol. 8, pp. 41- 56 ,(1997) , 10.1023/A:1008606530836
Colin P. Rourke, Brian J. Sanderson, Introduction to Piecewise-Linear Topology ,(1972)
Rainer E. Burkard, Horst W. Hamacher, Günter Rote, Sandwich approximation of univariate convex functions with an application to separable convex programming Naval Research Logistics. ,vol. 38, pp. 911- 924 ,(1991) , 10.1002/NAV.3800380609
Paul Armand, Finding all maximal efficient faces in multiobjective linear programming Mathematical Programming. ,vol. 61, pp. 357- 375 ,(1993) , 10.1007/BF01582157
B. Pelegrin, F. R. Fernandez, Determination of efficient points in multiple-objective location problems Naval Research Logistics. ,vol. 35, pp. 697- 705 ,(1988) , 10.1002/1520-6750(198812)35:6<697::AID-NAV3220350613>3.0.CO;2-8
Robert Fourer, A simplex algorithm for piecewise-linear programming III: computational analysis and application Mathematical Programming. ,vol. 53, pp. 213- 235 ,(1992) , 10.1007/BF01585703
Tomas Gal, A general method for determining the set of all efficient solutions to a linear vectormaximum problem European Journal of Operational Research. ,vol. 1, pp. 307- 322 ,(1977) , 10.1016/0377-2217(77)90063-7
A. R. Warburton, Quasiconcave vector maximization: Connectedness of the sets of Pareto-optimal and weak Pareto-optimal alternatives Journal of Optimization Theory and Applications. ,vol. 40, pp. 537- 557 ,(1983) , 10.1007/BF00933970
Arthur M. Geoffrion, Solving Bicriterion Mathematical Programs Operations Research. ,vol. 15, pp. 39- 54 ,(1967) , 10.1287/OPRE.15.1.39