Skip to Main content Skip to Navigation
Conference papers

Dominance Rules for the Choquet Integral in Multiobjective Dynamic Programming

Abstract : Multiobjective Dynamic Programming (MODP) is a general problem solving method used to determine the set of Pareto-optimal solutions in optimization problems involving discrete decision variables and multiple objectives. It applies to combinatorial problems in which Pareto-optimality of a solution extends to all its sub-solutions (Bellman principle). In this paper we focus on the determination of the preferred tradeoffs in the Pareto set where preference is measured by a Choquet integral. This model provides high descriptive possibilities but the associated preferences generally do not meet the Bellman principle, thus preventing any straightforward adaptation of MODP. To overcome this difficulty, we introduce here a general family of dominance rules enabling an early pruning of some Pareto-optimal sub-solutions that cannot lead to a Choquet optimum. Within this family, we identify the most efficient dominance rules and show how they can be incorporated into a MODP algorithm. Then we report numerical tests showing the actual efficiency of this approach to find Choquet-optimal tradeoffs in multiobjective knapsack problems.
Document type :
Conference papers
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Christine Okret-Manville <>
Submitted on : Friday, October 21, 2016 - 10:35:54 AM
Last modification on : Thursday, January 21, 2021 - 11:38:01 AM
Long-term archiving on: : Friday, February 3, 2017 - 12:52:29 PM


Publisher files allowed on an open archive


  • HAL Id : hal-01372497, version 1


Lucie Galand, Julien Lesca, Patrice Perny. Dominance Rules for the Choquet Integral in Multiobjective Dynamic Programming. 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013), Aug 2013, Beijing, China. pp.538-544. ⟨hal-01372497⟩



Record views


Files downloads