Finding a minimal efficient solution of a convex multiobjective program

DOI10.1023/B:JOTA.0000004872.93803.09MaRDI QIDQ597210zbMATH OpenOpenAlexFDO

Authors Zhongping Sheng, Zhenghua Lin, Daoli Zhu

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)

Cites work

• scientific article; zbMATH DE number 3682672 (Why is no real title available?)
• scientific article; zbMATH DE number 47206 (Why is no real title available?)
• scientific article; zbMATH DE number 3069611 (Why is no real title available?)
• scientific article; zbMATH DE number 3106184 (Why is no real title available?)
• A combined homotopy interior point method for convex nonlinear programming
• A combined homotopy interior point method for general nonlinear programming problems
• Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
• Finding all maximal efficient faces in multiobjective linear programming
• Generating all maximal efficient faces for multiple objective linear programs
• Global analysis and economics. VI: Geometric analysis of Pareto optima and price equilibria under classical hypotheses
• Linear complementarity problems and multiple objective programming
• Linear multiplicative programming
• Multiple-objective approximation of feasible but unsolvable linear complementarity problems
• Theory of globally convergent probability-one homotopies for nonlinear programming

Cited in

(10)

• Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials
• 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
• On the set of weakly efficient minimizers for convex multiobjective programming
• Homotopy method for a general multiobjective programming problem
• Homotopy method for a general multiobjective programming problem under generalized quasinormal cone condition
• A modified constraint shifting homotopy method for solving general nonlinear multiobjective programming
• 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
• scientific article; zbMATH DE number 6612741 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q597210)