3 papers
math.OC2023
Reference-Point-Based Branch and Bound Algorithm for Multiobjective Optimization
Weitian Wu, Xinmin Yang
In this paper, a branch and bound algorithm that incorporates the decision maker's preference information is proposed for multiobjective optimization. In the proposed algorithm, a…
math.OC2022
Variable Metric Method for Unconstrained Multiobjective Optimization Problems
Jian Chen, Gaoxi Li, Xinmin Yang
In this paper, we propose a variable metric method for unconstrained multiobjective optimization problems (MOPs). First, a sequence of points is generated using different positive…
math.OC2022
A Modification Piecewise Convexification Method for Box-Constrained Non-Convex Optimization Programs
Qiao Zhu, Liping Tang, Xinmin Yang
This paper presents a piecewise convexification method to approximate the whole approximate optimal solution set of non-convex optimization problems with box constraints. In the pr…