2012 | OriginalPaper | Buchkapitel
Multicriteria discarding tests
verfasst von : Daniel Scholz
Erschienen in: Deterministic Global Optimization
Verlag: Springer New York
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Under the assumption that the objective functions for a multicriteria optimization problem are differentiable, this chapter presents some general discarding tests that can be used throughout the algorithm presented in the previous chapter. The idea of these discarding tests is to obtain a sharp outer approximation of the set of Pareto optimal solutions. To this end, we recall the well-known Fritz John necessary conditions for Pareto optimality in Section 5.1 before the multicriteria discarding tests are presented in Section 5.2. The theoretical results are again illustrated on two bicriteria location problems introduced in Section 5.3. Some particular instances for these problems are solved in Section 5.4 twice, one time without multicriteria discarding tests and one time using these tests. We show that the second run yields a very sharp outer approximation of the set of all Pareto optimal solutions compared to the first run.