Computing upper and lower bounds in interval decision trees
From MaRDI portal
Publication:877064
DOI10.1016/J.EJOR.2006.06.030zbMATH Open1131.91016OpenAlexW1986542341MaRDI QIDQ877064FDOQ877064
Authors: Mats Danielson, Love Ekenberg 
Publication date: 19 April 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.06.030
Recommendations
- Decision trees with single and multiple interval-valued objectives
- A GENERAL APPROACH TO DECISION MAKING WITH INTERVAL PROBABILITIES
- Reducing interval-valued decision trees to conventional ones: comments on decision trees with single and multiple interval-valued objectives
- Optimizing the Hurwicz Criterion in Decision Trees with Imprecise Probabilities
- Using probability trees to compute marginals with imprecise probabilities
Cites Work
- Title not available (Why is that?)
- The Simplex Method for Quadratic Programming
- Title not available (Why is that?)
- A new polynomial-time algorithm for linear programming
- Title not available (Why is that?)
- A new understanding of subjective probability and its generalization to lower and upper prevision.
- Title not available (Why is that?)
- The use of Previous Experience in Reaching Statistical Decisions
- Title not available (Why is that?)
- Continuity properties of the Karush-Kuhn-Tucker point set in quadratic programming problems
- A dual-active-set algorithm for positive semi-definite quadratic programming
- Stable reduced Hessian updates for indefinite quadratic programming
- A block active set algorithm for large-scale quadratic programming with box constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A methodology for uncertainty in knowledge-based systems
- A New Algorithm for Solving Strictly Convex Quadratic Programs
- A framework for analysing decisions under risk
- Title not available (Why is that?)
- Basis- and partition identification for quadratic programming and linear complementarity problems
- A Finite Continuation Algorithm for Bound Constrained Quadratic Programming
- Generalized evaluation in decision analysis
- A quadratic programming algorithm using conjugate search directions
- The Use ofQRFactorization in Sparse Quadratic Programming and Backward Error Issues
- Title not available (Why is that?)
Cited In (14)
- A prescriptive approach to elicitation of decision data
- Generalized evaluation in decision analysis
- The Hurwicz Decision Rule’s Relationship to Decision Making with the Triangle and Beta Distributions and Exponential Utility
- Combining Second-Order Belief Distributions with Qualitative Statements in Decision Analysis
- Eliciting dual interval probabilities from interval comparison matrices
- Using intervals for global sensitivity and worst-case analyses in multiattribute value trees
- Decision trees with single and multiple interval-valued objectives
- Reducing interval-valued decision trees to conventional ones: comments on decision trees with single and multiple interval-valued objectives
- Decision making with interval probabilities
- Sequential decision making with partially ordered preferences
- Using probability trees to compute marginals with imprecise probabilities
- Implementing second-order decision analysis: concepts, algorithms, and tool
- Augmenting ordinal methods of attribute weight approximation
- A flexible elicitation procedure for additive model scale constants
Uses Software
This page was built for publication: Computing upper and lower bounds in interval decision trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877064)
