Finding a minimal efficient solution of a convex multiobjective program

DOI10.1023/B:JOTA.0000004872.93803.09zbMath1061.90102OpenAlexW2034446273MaRDI QIDQ597210

Z. P. Sheng, Dao-Li Zhu, Zhenghua Lin

Publication date: 6 August 2004

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:jota.0000004872.93803.09

zbMATH Keywords

global convergenceinterior-point methodsConvex multiobjective programsminimal efficient solutionsparametrized Sard theorem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Interior-point methods (90C51)

Related Items (7)

Homotopy method for a general multiobjective programming problem under generalized quasinormal cone condition ⋮ A constraint shifting homotopy method for finding a minimal efficient solution of nonconvex multiobjective programming ⋮ Homotopy interior-point method for a general multiobjective programming problem ⋮ Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming ⋮ A constraint shifting homotopy method for convex multi-objective programming ⋮ A modified constraint shifting homotopy method for solving general nonlinear multiobjective programming ⋮ Homotopy method for a general multiobjective programming problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear complementarity problems and multiple objective programming
• Linear multiplicative programming
• Global analysis and economics. VI: Geometric analysis of Pareto optima and price equilibria under classical hypotheses
• Generating all maximal efficient faces for multiple objective linear programs
• Finding all maximal efficient faces in multiobjective linear programming
• A combined homotopy interior point method for general nonlinear programming problems
• A combined homotopy interior point method for convex nonlinear programming
• Multiple-objective approximation of feasible but unsolvable linear complementarity problems
• Theory of Globally Convergent Probability-One Homotopies for Nonlinear Programming
• Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One

This page was built for publication: Finding a minimal efficient solution of a convex multiobjective program