Optimization problems with evidential linear objective

DOI10.1016/J.IJAR.2023.108987MaRDI QIDQ6178726zbMATH OpenFDO

Authors Tuan-Anh Vu, Sohaib Afifi, Éric Lefèvre, Frédéric Pichon

Publication date 4 September 2023

Published in International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.IJAR.2023.108987

zbMATH Keywords

belief functioncombinatorial optimizationlinear programmingrobust optimization

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• Linear programming with a possibilistic objective function
• scientific article; zbMATH DE number 4193453
• Optimization of linear-convex programs
• Linear Optimization Problems with Inexact Data
• Solution of a possibilistic multiobjective linear programming problem
• Linear complementarity problem and multiobjective optimization
• scientific article; zbMATH DE number 5158943
• scientific article; zbMATH DE number 3273621
• Solving multiple objective linear programs in objective space

Cites work

• An exact method for the biobjective shortest path problem for large-scale road networks
• Belief functions and statistical inference
• Constrained optimization problems under uncertainty with coherent lower previsions
• Decision making under uncertainty using imprecise probabilities
• Decision-making with belief functions: a review
• Discrete optimization with interval data. Minmax regret and fuzzy approach
• Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
• scientific article; zbMATH DE number 3694968 (Why is no real title available?)
• scientific article; zbMATH DE number 48344 (Why is no real title available?)
• scientific article; zbMATH DE number 3560492 (Why is no real title available?)
• scientific article; zbMATH DE number 1416629 (Why is no real title available?)
• Inclusion-exclusion principle for belief functions
• Independence concepts in evidence theory
• Introduction to imprecise probabilities
• Linear programming. Foundations and extensions
• Minimax regret solution to linear programming problems with an interval objective function
• Near-shortest and K-shortest simple paths
• On combinatorial optimization problems on matroids with uncertain weights
• On modelling and solving the shortest path problem with evidential weights
• On the robust shortest path problem.
• Shortest path problems with partial information: Models and algorithms for detecting dominance
• Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming
• The capacitated vehicle routing problem with evidential demands
• The computational complexity of the criticality problems in a network with interval activity times
• The robust spanning tree problem with interval data
• The vehicle routing problem with time windows and evidential service and travel times: a recourse model

Cited in

(2)

• scientific article; zbMATH DE number 5158943 (Why is no real title available?)
• Optimization problems with uncertain objective coefficients using capacities

This page was built for publication: Optimization problems with evidential linear objective

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6178726)