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

DOI10.1080/02331934.2012.724684MaRDI QIDQ2926481zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

decision theoryinterval branch-and-bound algorithminterval-order relationuncertain global optimization

Mathematics Subject Classification ID

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)

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

Cites work

• A heuristic rejection criterion in interval global optimization algorithms
• An interval arithmetic method for global optimization
• Computational method for the profit bounds of inventory model with interval demand and unit cost
• Experiments with a new selection criterion in a fast interval optimization algorithm
• Generalized subinterval selection criteria for interval global optimization
• Heuristic rejection in interval global optimization
• Interval oriented multi-section techniques for global optimization
• Introduction to Interval Analysis
• Min-transitivity of fuzzy leftness relationship and its application to decision making
• Multiobjective programming in optimization of interval objective functions -- a generalized approach
• Multiobjective programming in optimization of the interval objective function
• Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results
• Multisection in interval branch-and-bound methods for global optimization. II: Numerical tests
• New interval analysis support functions using gradient information in a global minimization algorithm
• On an efficient use of gradient information for accelerating interval global optimization algorithms
• On comparing interval numbers
• Two-objective method for crisp and fuzzy interval comparison in optimization
• Using geometric programming to profit maximization with interval coefficients and quantity discount

Cited in

(6)

• A New Interval Multi-Objective Optimization Method for Uncertain Problems with Dependent Interval Variables
• Interval oriented multi-section techniques for global optimization
• A new multi-section based technique for constrained optimization problems with interval-valued objective function
• 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)