Characterizing coherence, correcting incoherence
type: Item
instance of: scholarly article
title: Characterizing coherence, correcting incoherence
zbMATH Open document ID: 1388.68273
author: Erik Quaeghebeur
published in: International Journal of Approximate Reasoning
publication date: 2014-11-24T00:00:00Z
Mathematics Subject Classification ID: 68T37
Mathematics Subject Classification ID: 60A05
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6372147
zbMATH Keywords: coherence
zbMATH Keywords: avoiding sure loss
zbMATH Keywords: polytope theory
zbMATH Keywords: multi-objective linear programming
zbMATH Keywords: incoherence
zbMATH Keywords: dominance
describes a project that uses: MPT
describes a project that uses: mcohconstraints
describes a project that uses: Pycohconstraints
MaRDI profile type: Publication
full work available at URL: j.ijar.2014.03.005
OpenAlex ID: W2058075017
cites work: Q3999364
cites work: A survey of the theory of coherent lower previsions
cites work: Q5547252
cites work: Lectures on Polytopes
cites work: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
cites work: Multicriteria Optimization
cites work: Computation of ideal and Nadir values and implications for their use in MCDM methods.
cites work: An exact method for computing the nadir values in multiple objective linear programming
cites work: An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
cites work: A dual variant of Benson's ``outer approximation algorithm'' for multiple objective linear programming
cites work: A revised simplex method for linear multiple objective programs
cites work: A simplified MOLP algorithm: The MOLP-S procedure
cites work: The set of all nondominated solutions in linear cases and a multicriteria simplex method
cites work: The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
cites work: Direct algorithms for checking consistency and making inferences from conditional probability assessments
cites work: A generalization of the fundamental theorem of de Finetti for imprecise conditional probability assessments
cites work: Extreme lower probabilities
cites work: IMPRECISE PREVISIONS FOR RISK MEASUREMENT
cites work: Elementary fundamentals of a more general probability theory. I: Interval probability as comprehensive conception. In cooperation with T. Augustin and A. Wallner
cites work: The theory of interval-probability as a unifying concept for uncertainty
DOI: 10.1016/J.IJAR.2014.03.005
description: scientific article; zbMATH DE number 6372147