A constraint shifting homotopy method for convex multi-objective programming

DOI10.1016/j.cam.2011.07.011zbMath1236.65068OpenAlexW2072426750MaRDI QIDQ651890

Bo Yu, Yu-Feng Shang

Publication date: 19 December 2011

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2011.07.011

zbMATH Keywords

global convergencenumerical resultshomotopy methodminimal efficient solutionsconvex multi-objective programs

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Multi-objective and goal programming (90C29)

Related Items (3)

Homotopy method for a general multiobjective programming problem under generalized quasinormal cone condition ⋮ Unnamed Item ⋮ An infeasible homotopy method for solving fixed point problems on a general unbounded set

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding a minimal efficient solution of a convex multiobjective program
• Homotopy method for a general multiobjective programming problem
• Theory of multiobjective optimization
• Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
• Evolutionary Algorithms for Solving Multi-Objective Problems

This page was built for publication: A constraint shifting homotopy method for convex multi-objective programming