|
|
|
|
|
by montecarl
1381 days ago
|
|
This is a very low effort blog post on this subject, I'm not sure it is adding anything new to the topic and just feels like the same sort of low quality blog spam that shows up at the top of Google search results instead of a high quality introduction to the subject. Its mentioned in the article, but what I find neat about multi-objective optimization is that (for a certain type of well behaved problem) the "solution" is not a single point (0 dimensional) like in normal optimization, but is N-1 dimensional where N is the number of objective functions. So if you have 2 objective functions the best solutions all lay on some 1d curve and if you have 3 they fall on some 2d surface and so on. This is called the Pareto front and Wikipedia has some nice visualizations[1]. It is then left as an additional exercise to pick out the best solution to your problem from the Pareto front. A common example from engineering is optimizing for strength and weight. You may want an airplane wing to be very strong and very light and the Pareto front represents the best solutions for at a given strength/weight and then you can use other information to pick a particular solution. [1] https://en.wikipedia.org/wiki/Pareto_front |
|