Homotopy interior-point method for a general multiobjective programming problem

DOI10.1155/2012/497345zbMath1244.90215OpenAlexW2091009593WikidataQ58906005 ScholiaQ58906005MaRDI QIDQ442940

J. Herrera, H. S. Yoon

Publication date: 6 August 2012

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

Full work available at URL: https://doi.org/10.1155/2012/497345

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items

Homotopy method for a class of multiobjective optimization problems with equilibrium constraints, 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

Cites Work

• Unnamed Item
• Finding a minimal efficient solution of a convex multiobjective program
• Homotopy method for a general multiobjective programming problem
• A convergent process of price adjustment and global Newton methods
• A combined homotopy interior point method for convex nonlinear programming
• On the extended linear complementarity problem
• An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
• The Projective SUMT Method for Convex Programming
• A Constructive Proof of the Brouwer Fixed-Point Theorem and Computational Results
• Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
• Finite-Dimensional Variational Inequalities and Complementarity Problems