An efficient interval computing technique for bound-constrained uncertain optimization problems
DOI10.1080/02331934.2012.724684zbMATH Open1305.90334OpenAlexW1973567698MaRDI QIDQ2926481FDOQ2926481
Authors: 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
Recommendations
- A new multi-section based technique for constrained optimization problems with interval-valued objective function
- Interval oriented multi-section techniques for global optimization
- An alternative optimization technique for interval objective constrained optimization problems via multiobjective programming
- A new uncertain optimization method based on intervals and an approximation management model
- Interval differential evolution with dimension-reduction interval analysis method for uncertain optimization problems
decision theoryinterval branch-and-bound algorithminterval-order relationuncertain global optimization
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Decision theory (91B06) Nonconvex programming, global optimization (90C26) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)
Cites Work
- Introduction to Interval Analysis
- Multiobjective programming in optimization of interval objective functions -- a generalized approach
- New interval analysis support functions using gradient information in a global minimization algorithm
- Multiobjective programming in optimization of the interval objective function
- Interval oriented multi-section techniques for global optimization
- Heuristic rejection in interval global optimization
- 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
- Generalized subinterval selection criteria for interval global optimization
- Experiments with a new selection criterion in a fast interval optimization algorithm
- A heuristic rejection criterion in interval global optimization algorithms
- Min-transitivity of fuzzy leftness relationship and its application to decision making
- An interval arithmetic method for global optimization
- Two-objective method for crisp and fuzzy interval comparison in optimization
- Computational method for the profit bounds of inventory model with interval demand and unit cost
- Using geometric programming to profit maximization with interval coefficients and quantity discount
- On an efficient use of gradient information for accelerating interval global optimization algorithms
Cited In (6)
- A new multi-section based technique for constrained optimization problems with interval-valued objective function
- A New Interval Multi-Objective Optimization Method for Uncertain Problems with Dependent Interval Variables
- Interval oriented multi-section techniques for global optimization
- Optimization problems with interval uncertainty: branch and bound method
- An alternative optimization technique for interval objective constrained optimization problems via multiobjective programming
- Gradient-based descent linesearch to solve interval-valued optimization problems under gH-differentiability with application to finance
This page was built for publication: An efficient interval computing technique for bound-constrained uncertain optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2926481)
