On constrained optimization by interval arithmetic and interval order relations
From MaRDI portal
Publication:505105
DOI10.1007/s12597-011-0061-2zbMath1353.90184OpenAlexW2160275577MaRDI QIDQ505105
Samiran Karmakar, Asoke Kumar Bhunia
Publication date: 19 January 2017
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12597-011-0061-2
Management decision making, including multiple objectives (90B50) Approximation methods and heuristics in mathematical programming (90C59) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)
Related Items
A new multi-section based technique for constrained optimization problems with interval-valued objective function, A study of interval optimization problems, An alternative optimization technique for interval objective constrained optimization problems via multiobjective programming, Combining interval branch and bound and stochastic search, A Mazur–Orlicz Type Theorem in Interval Analysis and Its Consequences, Extended Nondominated Sorting Genetic Algorithm (ENSGA-II) for Multi-Objective Optimization Problem in Interval Environment
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A novel approach in uncertain programing. I: New arithmetic and order relation for interval numbers
- Efficient interval partitioning for constrained global optimization
- Interval oriented multi-section techniques for global optimization
- A local exploration-based differential evolution algorithm for constrained global optimization
- A filter-variable-metric method for nonsmooth convex constrained optimization
- Solving constrained optimization problems using a novel genetic algorithm
- The global convergence of augmented Lagrangian methods based on NCP function in constrained nonconvex optimization
- 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
- Rigorous global search: continuous problems
- Heuristic rejection in interval global optimization
- An efficient constraint handling method for genetic algorithms
- 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
- Ordering of intervals and optimization problems with interval parameters
- Generalized subinterval selection criteria for interval global optimization
- Derivative-free filter simulated annealing method for constrained continuous global optimization
- Investigating a hybrid simulated annealing and local search algorithm for constrained optimization
- Two-objective method for crisp and fuzzy interval comparison in optimization
- Multiobjective programming in optimization of the interval objective function
- Interval-arithmetic-oriented interval computing technique for global optimization
