Generating the weakly efficient set of nonconvex multiobjective problems

DOI10.1007/s10898-007-9263-9zbMath1152.90590OpenAlexW2093976619MaRDI QIDQ934803

Dinh The Luc, Daniel Gourion

Publication date: 30 July 2008

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-007-9263-9

zbMATH Keywords

Nonconvex multiobjective problemScalarizationWeakly efficient solution

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31)

Related Items

A Benson type algorithm for nonconvex multiobjective programming problems ⋮ A numerical method for constructing the Pareto front of multi-objective optimization problems ⋮ Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems ⋮ Set Optimization—A Rather Short Introduction ⋮ Solving generalized convex multiobjective programming problems by a normal direction method ⋮ A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems

Uses Software

• NBI

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scalarization of vector optimization problems
• Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
• Linear multiobjective programming
• Vector maximization with two objective functions
• An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
• Nonlinear multiobjective optimization
• Finding all maximal efficient faces in multiobjective linear programming
• Normal cones to a polyhedral convex set and generating efficient faces in linear multiobjective programming
• Outcome space partition of the weight set in multiobjective linear programming
• Unbiased approximation in multicriteria optimization
• Scalarizing vector optimization problems
• A new duality approach to solving concave vector maximization problems
• Approximation methods in multiobjective programming
• SUBLINEAR OPERATORS AND THEIR APPLICATIONS
• An Existence Theorem in Vector Optimization
• Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
• Scalarizing Functions for Generating the Weakly Efficient Solution Set in Convex Multiobjective Problems