An interval algorithm for multi-objective optimization

DOI10.1007/S00158-004-0496-7zbMath1243.90205OpenAlexW2037233645MaRDI QIDQ438503

G. R. Ruetsch

Publication date: 31 July 2012

Published in: Structural and Multidisciplinary Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00158-004-0496-7

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items (5)

A survey of interval algorithms for solving multicriteria analysis problems ⋮ Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization ⋮ First order rejection tests for multiple-objective optimization ⋮ Nonlinear biobjective optimization: improving the upper envelope using feasible line segments ⋮ Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms

Uses Software

• NBI

Cites Work

• Interval Methods for Systems of Equations
• Introduction to Numerical Analysis
• Multiobjective Optimization
• Aggregate objective functions and Pareto frontiers: required relationships and practical implications
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An interval algorithm for multi-objective optimization