An efficient interval computing technique for bound-constrained uncertain optimization problems
DOI10.1080/02331934.2012.724684zbMath1305.90334OpenAlexW1973567698MaRDI 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
decision theoryinterval branch-and-bound algorithminterval-order relationuncertain global optimization
Decision theory (91B06) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)
Related Items (1)
Cites Work
- Computational method for the profit bounds of inventory model with interval demand and unit cost
- Interval oriented multi-section techniques for global optimization
- Using geometric programming to profit maximization with interval coefficients and quantity discount
- An interval arithmetic method for global optimization
- Multiobjective programming in optimization of interval objective functions -- a generalized approach
- Min-transitivity of fuzzy leftness relationship and its application to decision making
- Heuristic rejection in interval global optimization
- New interval analysis support functions using gradient information in a global minimization algorithm
- Multisection in interval branch-and-bound methods for global optimization. II: Numerical tests
- Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results
- On comparing interval numbers
- On an efficient use of gradient information for accelerating interval global optimization algorithms
- Generalized subinterval selection criteria for interval global optimization
- Two-objective method for crisp and fuzzy interval comparison in optimization
- Multiobjective programming in optimization of the interval objective function
- Introduction to Interval Analysis
- Experiments with a new selection criterion in a fast interval optimization algorithm
- A heuristic rejection criterion in interval global optimization algorithms
This page was built for publication: An efficient interval computing technique for bound-constrained uncertain optimization problems
