Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization

DOI10.1016/j.ejor.2016.05.045zbMath1403.90612MaRDI QIDQ1753511

Laurent Granvilliers, Alexandre Goldsztejn, Christophe Jermann, Benjamin T. Martin

Publication date: 29 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.05.045

zbMATH Keywords

nonlinear optimization; constraint propagation; biobjective optimization; interval branch \& bound

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C29: Multi-objective and goal programming

90C30: Nonlinear programming

Uses Software

• RealPaver
• INTOPT_90
• NBI
• gaol
• IbexOpt
• Numerica

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the representation of the search region in multi-objective optimization
• A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
• An interval algorithm for multi-objective optimization
• Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
• An efficient and safe framework for solving optimization problems
• Bound sets for biobjective combinatorial optimization problems
• Adaptive constructive interval disjunction: algorithms and experiments
• On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach
• A note on epsilon-inflation
• Nonlinear multiobjective optimization
• Rigorous global search: continuous problems
• First order rejection tests for multiple-objective optimization
• Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
• Second-order sufficient optimality conditions for local and global nonlinear programming
• Constructive Interval Disjunction
• Algorithm 852
• Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
• Complete search in continuous global optimization and constraint satisfaction
• Multicriteria Optimization