An efficient interval computing technique for bound-constrained uncertain optimization problems

DOI10.1080/02331934.2012.724684zbMath1305.90334MaRDI QIDQ2926481

Samiran Karmakar, Asoke Kumar Bhunia

Publication date: 24 October 2014

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2012.724684

zbMATH Keywords

decision theory; interval branch-and-bound algorithm; interval-order relation; uncertain global optimization

Mathematics Subject Classification ID

91B06: Decision theory

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C26: Nonconvex programming, global optimization

90C70: Fuzzy and other nonstochastic uncertainty mathematical programming