These objecves are normally conicng with each other

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: •  Minimize f(x) & penalty(x) data a b c d e f dominances 6 a 5 penalty(x) •  The problem has several objec/ves to sa/sfy. •  These objec/ves are normally conflic/ng with each other. For example: 4 b 3 2 e 1 f c 0 0 5 d f(x) 10 15 1 2/11/14 Pareto ­op/mal Solu/ons Pareto ­Op/mal Fronts •  The set of solu/ons that are not dominated by any other solu/ons in the solu/on space is call Pareto ­op/mal solu/ons. •  The set of non ­dominated solu/ons is o^en called Pareto ­op/mal front as they reside at the boundary of the solu/on space. •  What are the Pareto ­op/mal front of the previous example solu/ons? Two Goals in Mul/ ­Objec/ve Op/miza/on •  Converge to the Pareto ­op/mal front •  Maintain the Pareto ­op/mal front with as diverse a...
View Full Document

This document was uploaded on 02/28/2014 for the course CS 6776 at Memorial University.

Ask a homework question - tutors are online