Approximation methods in multiobjective programming

Journal of Optimization Theory and Applications

Volumn 126, Issue 3, 2005, Pages 473-501

  Ruzika, S ^a   Wiecek, M M ^b  

^a Rheinland Pfälzische Technische Universität Kaiserslautern Landau   (Germany)

^b CLEMSON UNIVERSITY   (United States)

Author keywords

Approximation; Efficient sets; Multiobjective programming; Nondominated sets; Pareto sets

Indexed keywords

COMPUTER PROGRAMMING; PARETO PRINCIPLE;

APPROXIMATION; APPROXIMATION METHODS; APPROXIMATION QUALITY; EFFICIENT SETS; MULTIOBJECTIVE PROGRAM; MULTIOBJECTIVE PROGRAMMING; NON-DOMINATED SETS; PARETO POINTS; PARETO SET;

MULTIOBJECTIVE OPTIMIZATION;

EID: 23844480435     PISSN: 00223239     EISSN: 15732878     Source Type: Journal    
DOI: 10.1007/s10957-005-5494-4     Document Type: Review

References (65)

1. DEB, K., Multiobjective Optimization Using Evolutionary Algorithms, Series in Systems and Optimization, John Wiley and Sons, Chichester, England, 2001.
2. COELLO COELLO, C., VAN VELDHUIZEN, D., and LAMONT, G., Evolutionary Algorithms for Solving Multiobjective Problems, Kluwer Academic Publishers, Boston, Massachusetts, 2002.
3. EHRGOTT, M., and GANDIBLEUX, X., Multiobjective Combinatorial Optimization, Multiple-Criteria Optimization: State of the Art Annotated Bibliographic Surveys, Kluwer Academic Publishers, Boston, Massachusetts, 2002.
4. EHRGOTT, M., and WIECEK, M. M., Multiobjective Programming, Multiple-Criteria Decision Analysis: State of the Art Surveys, Edited by J. Figueira, S. Greco, and M. Ehrgott, Springer, Berlin, Germany, 2005.
5. PAYNE, H. J., POLAK, E., COLLINS, D. C., and MEISEL, W. S., An Algorithm for Bicriteria Optimization Based on the Sensitivity Function, IEEE Transactions on Automatic Control, Vol. 20, pp. 546-648, 1975.
6. POLAK, E., On the Approximation of Solutions to Multiple-Criteria Decision Making Problems, Lecture Notes in Economics and Mathematical Systems, Springer, New York, NY, Vol. 123, pp. 271-282, 1976.
7. JAHN, J., and MERKEL, A., Reference-Point Approximation Method for the Solution of Bicriterial Nonlinear Optimization Problems, Journal of Optimization Theory and Applications, Vol. 78, pp. 87-103, 1992.
8. HELBIG, S., On a Constructive Approximation of the Efficient Outcomes in Bicriterion Vector Optimization, Journal of Global Optimization, Vol. 5, pp. 35-48. 1994.
9. SCHANDL, B., KLAMROTH, K., and WIECEK, M. M., Norm-Based Approximation in Bicriteria Programming, Computational Optimization and Applications, Vol. 20, pp. 23-42, 2001.
10. DAS, I., An Improved Technique for Choosing Parameters for Pareto Surface Generation Using Normal-Boundary Intersection, Proceedings of The 3rd World Congress of Structural and Multidisciplinary Optimization, Buffalo, NY, 1999.
11. COHON, J., CHURCH, R., and SHEER, D., Generating Multiobjective Tradeoffs: An Algorithm for Bicriterion Problems, Water Resources Research, Vol. 15, pp. 1001-1010, 1979.
12. ERUHWIRTH, B., BURKARD, R. E., and ROTE, G., Approximation of Convex Curves with Application to the Bicriterial Minimum Cost Flow Problem, European Journal of Operational Research, Vol. 42, pp. 326-338, 1989.
13. YANG, X., and GOH, C., A Method for Convex Curve Approximation, European Journal of Operational Research, Vol. 97, pp. 205-212, 1997.
14. SOLANKI, R. S., and COHON, J. L., Approximating the Noninferior Set in Linear Biobjective Programs Using Multiparametric Decomposition, European Journal of Operational Research, Vol. 41, pp. 355-366, 1989.
15. RUHE, G., and FRUHWIRTH, B., ε-Optimality for Bicriteria Programs and Its Application to Minimum Cost Flows, Computing, Vol. 44, pp. 21-34, 1990.
16. PAYNE, A. N., and POLAK, E., An Interactive Rectangle Elimination Method for Biobjective Decision Making, IEEE Transactions on Automatic Control, Vol. 25 pp. 421-432, 1980.
17. SOLANKI, R. S., Generating the Noninferior Set in Mixed Integer Biobjective Linear Programs: An Application to a Location Problem, Computers and Operations Research, Vol. 18, pp. 1-15, 1991.
18. PAYNE, A. N., Efficient Approximate Representation of Biobjective Tradeoff Sets, Journal of the Franklin Institute, Vol. 330, pp. 1219-1233, 1993.
19. WIECEK, M., CHEN, W., and ZHANG, J., Piecewise Quadratic Approximation of the Nondominated Set for Bicriteria Programs, Journal of Multicriteria Decision Analysis, Vol. 10, pp. 35-47, 2001.
20. Liu, Y., TEO, K., and YANG, X., Approximation Methods for Nonconvex Curves, European Journal of Operational Research, Vol. 117, pp. 125-135, 1999.
21. Li, Y., FADEL, G. M., and WIECEK, M. M., Minimum-Effort Approximation of the Pareto Space of Convex Bicriteria Problems, Optimization and Engineering, Vol. 4, pp. 231-261, 2003.
22. FADEL, G., and Li, Y., Approximating the Pareto Curve to Help Solve Biobjective Design Problems, Structural Multidisciplinary Optimization, Vol. 23 pp. 280-296, 2002.
23. POPOV, N., Approximation of a Pareto Set by the Convolution Method, Moscow University, Computational Mathematics and Cybernetics, Vol. 2, pp. 41-48, 1982.
24. NEFËDOV, V. N., Approximation of a Set of Pareto-Optimal Solutions, USSR Computational Mathematics and Mathematical Physics, Vol. 26, pp. 99-107, 1986.
25. NEFËDOV, V. N., On the Approximation of a Pareto Set, USSR Computational Mathematics and Mathematical Physics, Vol. 24, pp. 19-28, 1984.
26. DAS, I., On Characterizing the "Knee" of the Pareto Curve Based on Normal-Boundary Intersection, Structural Optimization, Vol. 18, pp. 107-115, 1999.
27. STEUER, R. E., and HARRIS, F. W., Intra-set Point Generation and Filtering in Decision and Criterion Space, Computers and Operations Research, Vol. 7, pp. 41-58, 1980.
28. REUTER, H., An Approximation Method for the Efficiency Set of Multiobjective Programming Problems, Optimization, Vol. 21, pp. 905-911, 1990.
29. SAYIN, S., A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors, Operations Research, Vol. 51, pp. 427-436, 2003.
30. SMIRNOV, M., The Logical Convolution of the Criterion Vector in the Problem of Approximating a Pareto Set, Computational Mathematics and Mathematical Physics, Vol. 36, pp. 605-614, 1996.
31. BUCHANAN, J., and GARDINER, L., A Comparison of Two Reference-Point Methods in Multiple-Objective Mathematical Programming, European Journal of Operational Research, Vol. 149, pp. 17-34, 2003.
32. FLIEGE, J., and HESELER, A., Constructing Approximations to the Efficient Set of Convex Quadratic Multiobjective Problems, Technical Report, Ergebnisberichte in Angewandte Mathematik, Fachbereich Mathematik, Universität Dortmund, Dortmund, Germany, 2002.
33. DAS, I., and DENNIS, J., Normal Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems, SIAM Journal on Optimization, Vol. 8, pp. 631-657, 1998.
34. CHURKINA, S. Y., Search for Efficient Solutions of Multicriterion Problems by Target-Level Method, Computational Mathematics and Modeling, Vol. 13, pp. 208-214, 2002.
35. HELBIG, S., Approximation of the Efficient Point Set by Perturbation of the Ordering Cone, ZOR: Methods and Models of Operations Research, Vol. 35, pp. 197-220, 1991.
36. ABRAMOVA, M., Approximation of a Pareto Set on the Basis of Inexact Information, Moscow University, Computational Mathematics and Cybernetics, Vol. 2, pp. 62-69, 1986.
37. ARMANN, R., Solving Multiobjective Programming Problems by Discrete Representations, Optimization, Vol. 20, pp. 483-492, 1989.
38. KOSTREVA, M. M., ZHENG, Q., and ZHUANG, D., A Method for Approximating Solutions of Multicriteria Nonlinear Optimization Problems, Optimization Methods and Software, Vol. 5, pp. 209-226, 1995.
39. BENSON, H. P., and SAYIN, S., Toward Finding Global Representations of the Efficient Set in Multiple-Objective Mathematical Programming, Naval Research Logistics, Vol. 44, pp. 47-67, 1997.
40. KARASKAL, E. K., and KÖKSALAN, M., Generating a Representative Subset of the Efficient Frontier in Multiple-Criteria Decision Analysis, Working Paper 01-20, Faculty of Administration, University of Ottawa, Ottawa, Ontario, Canada, 2001.
41. WILSON, B., CAPELLERI, D. J., SIMPSON, T. W., and FRECKER, M. I., Efficient Pareto Frontier Exploration Using Surrogate Approximations, 8th AIAA/USAF/NASA/ISSMO Symposium on Multidisciplinary Analysis and Optimization, Long Beach, California, 2000.
42. MESSAC, A., and MATTSON, C. A., Generating Well-Distributed Sets of Pareto Points for Engineering Using Physical Programming, Optimization and Engineering, Vol. 3, pp. 431-450, 2002.
43. ISMAIL-YAHAYA, A., and MESSAC, A., Effective Generation of the Pareto Frontier The Normalized Normal-Constraint Method, Paper AIAA-2002-1232, AIAA/ASME/ASCE/AHS Structures, Structural Dynamics, and Material Conference, Denver, Colorado, 2002.
44. MATTSON, C., MULLUR, A., and MESSAC, A., Minimal Representation of Multi-objective Design Space Using a Smart Pareto Filter, 9th AIAA/ISSMO Symposium on Multidisciplinary Analysis and Optimization, Atlanta, Georgia, 2002.
45. CHERNYKH, O., Approximating the Pareto Hull of a Convex Set by Polyhedral Sets, Computational Mathematics and Mathematical Physics, Vol. 35, pp. 1033-1039, 1995.
46. SCHANDL, B., KLAMROTH, K., and WIECEK, M. M., Norm-Based Approximation in Multicriteria Programming, Computers and Mathematics with Applications, Vol. 44, pp. 925-942, 2002.
47. MINKOWSKI, H., Gesammelte Abhandlungen, Vol. 2, Teubner Verlag, Leipzig, Germany, 1911 (in German).
48. VOINALOVICH, V., External Approximation to the Pareto Set in Criterion Space for Multicriterion Linear Programming Tasks, Cybernetics and Computing Technology, Vol. 1, pp. 135-142, 1984.
49. BENSON, H. P., An Outer-Approximation Algorithm for Generating All Efficient Extreme Points in the Outcome Set of a Multiple-Objective Linear Programming Problem, Journal of Global Optimization, Vol. 13, pp. 1-24, 1998.
50. KALISZEWSKI, I., Quantitative Pareto Analysis by Cone Separation Technique, Kluwer Academic Publishers, Dordrecht, Netherlands, 1994.
51. SOLANKI, R. S., APPINO, P. A., and COHON, J. L., Approximating the Noninferior Set in Multiobjective Linear Programming Problems, European Journal of Operational Research, Vol. 68, pp. 356-373, 1993.
52. KLAMROTH, K., TIND, J., and WIECEK, M. M., Unbiased Approximation in Multicriteria Optimization, Mathematical Methods of Operations Research, Vol. 56, pp. 413-437, 2002.
53. MATEOS, A., and RIOS-INSUA, S., Approximation of Value Efficient Solutions, Journal of Multicriteria Decision Analysis, Vol. 6, pp. 227-232, 1997.
54. MATEOS, A., RIOS-INSUA, S., and PRIETO, L., Computational Study of the Relationships between Feasible and Efficient Sets and an Approximation, Computational Optimization and Applications, Vol. 14, pp. 241-260, 1999.
55. SAYIN, S., Measuring the Quality of Discrete Representations of Efficient Sets in Multiple-Objective Mathematical Programming, Mathematical Programming, Vol. 87, pp. 543-560, 2000.
56. BEAUZAMY, B., Approximation des Optima de Pareto, Seminaire Choquet 1977/1978;
57. Initiation a l'Analyse, No. 2, Exposé 17, 1978 (in French).
58. KARYAKIN, A. A., Methods of Construction and Approximation of the Pareto Boundary of Linear Multicriteria Problems, Software of Economic Studies, Collection of Scientific Works, Novosibirsk, Russia, pp. 25-36, 1985 (in Russian).
59. LOTOV, A., KAMENEV, G., and BEREZKIN, V., Approximation and Visualization of the Pareto Frontier for Nonconvex Multicriteria Problems, Doklady Mathematics, Vol. 66, pp. 260-262, 2002 (in Russian).
60. POLISHCHUK, L., A Piecewise Linear Approximation of the Pareto Boundary for Convex Two-Criteria Problems, Models and Methods of Investigating Economic Systems, Collection of Scientific Works, Novosibirsk, Russia, pp. 108-116, 1979 (in Russian).
61. POPOV, N., Estimation of the Computational Complexity of Multicriteria Optimization, Computing Complexes and Modeling of Complex Systems, Collection of Scientific Works, Moscow, Russia, pp. 142-152, 1989 (in Russian).
62. POPOVICI, N., On the Approximation of Efficiency Sets, Revue d'Analyse Numérique et de Théorie de l'Approximation, Vol. 27, pp. 321-329, 1998 (in French).
63. POSTOLICA, V., and SCARELLI, A., Some Connections between Best Approximation, Vectorial Optimization, and Multicriteria Analysis, Nonlinear Analysis Forum, Vol. 5, pp. 111-123, 2000.
64. SMIRNOV, M., Methods for Approximating Faces of a Pareto Set in Linear Multicriterion Problems, Vestnik Moskovskogo Universiteta, Matematika i Kibernetika, Vol. 15, pp. 37-43, 1996 (in Russian).
65. YANNAKAKIS, M., Approximation of Multiobjective Optimization Problems, Algorithms and Data Structures: 7th International Workshop, Edited by F. Dehne, J. R. Sack, and R. Tamassia, 2001.