Computing upper and lower bounds in interval decision trees
type: Item
instance of: scholarly article
title: Computing upper and lower bounds in interval decision trees
zbMATH Open document ID: 1131.91016
author: Mats Danielson
author: Love Ekenberg
published in: European Journal of Operational Research
publication date: 2007-04-19T00:00:00Z
Mathematics Subject Classification ID: 91B06
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 5144975
zbMATH Keywords: decision analysis
zbMATH Keywords: decision trees
zbMATH Keywords: bilinear programming
zbMATH Keywords: multi-linear programming
describes a project that uses: CG+
MaRDI profile type: Publication
full work available at URL: j.ejor.2006.06.030
OpenAlex ID: W1986542341
cites work: The Use ofQRFactorization in Sparse Quadratic Programming and Backward Error Issues
cites work: Q3229784
cites work: A quadratic programming algorithm using conjugate search directions
cites work: Basis- and partition identification for quadratic programming and linear complementarity problems
cites work: A dual-active-set algorithm for positive semi-definite quadratic programming
cites work: Q4003375
cites work: Generalized evaluation in decision analysis
cites work: A framework for analysing decisions under risk
cites work: Q3844775
cites work: Q5465302
cites work: A block active set algorithm for large-scale quadratic programming with box constraints
cites work: Q4226179
cites work: Stable reduced Hessian updates for indefinite quadratic programming
cites work: Q4356194
cites work: Q4945416
cites work: The use of Previous Experience in Reaching Statistical Decisions
cites work: A new polynomial-time algorithm for linear programming
cites work: Q5608986
cites work: A New Algorithm for Solving Strictly Convex Quadratic Programs
cites work: A Finite Continuation Algorithm for Bound Constrained Quadratic Programming
cites work: Q5571447
cites work: A new understanding of subjective probability and its generalization to lower and upper prevision.
cites work: Continuity properties of the Karush-Kuhn-Tucker point set in quadratic programming problems
cites work: Q4719195
cites work: A methodology for uncertainty in knowledge-based systems
cites work: The Simplex Method for Quadratic Programming
DOI: 10.1016/J.EJOR.2006.06.030
description: scientific article; zbMATH DE number 5144975