Reducing the pareto optimal set in multicriteria optimization

Engineering Optimization

Volumn 8, Issue 3, 1985, Pages 189-206

  Rosenman, M A ^a   Gero, J S ^a  

^a UNIVERSITY OF SYDNEY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0011374085     PISSN: 0305215X     EISSN: 10290273     Source Type: Journal    
DOI: 10.1080/03052158508902489     Document Type: Article

References (9)

1. M.R. Anderberg. Cluster Analysis for Applications. Academic Press, New York, (1973).
2. E.J. Bijnen, Cluster Analysis, Tilburg University Press, The Netherlands. (1973).
3. CARU, PGRAPH Users Manual. Computer Applications Research Unit, Department of Architectural Science, University of Sydney. (1983).
4. J.L. Cohon, Multiobjective Programming and Planning, Academic Press. New York. (1978).
5. J.N. Morse, “Reducing the Size of the Nondominated Set: Pruning by Clustering,” Computers and Operations Research. 7, (1–2), 55–66, (1980).
6. R.D. Perlack and C.E. Willis. “An Application of Multiple Objective Programming to the Evaluation of Sewage Sludge Disposal Alternatives,” Paper presented at the Operations Research Society Meeting, Toronto, Canada. May 6, (1981).
7. M.A. Rosenman and J.S. Gero, “Pareto Optimal Dynamic Programming,” Engineering Optimization. 6, (4), 177–188, (1983).
8. R.E. Steuer and F.W. Harris, “Intra-Set Point Generation and Filtering in Decision and Criterion Space,” Computers and Operations Research, 7, (1–2), 41–53, (1980).
9. A.A. Torn, “A Sampling-Search-Clustering Approach for Exploring the Feasible/Efficient Solutions of MCDM Problems,” Computers and Operations Research, 7, (1–2), 67–79, (1980).