A primal-dual infeasible-interior-point algorithm for multiple objective linear programming problems

DOI10.1007/BF02830664zbMath1096.90043MaRDI QIDQ5892653

Yuan Yuan, Pusheng Fei, Hui Huang

Publication date: 4 July 2005

Published in: Wuhan University Journal of Natural Sciences (Search for Journal in Brave)

zbMATH Keywords

multiple objective linear programminginfeasible-interior-point algorithmprimaldual

Mathematics Subject Classification ID

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

Cites Work

• Feasibility issues in a primal-dual interior-point method for linear programming
• Computational experience with a primal-dual interior point method for linear programming
• A primal-dual infeasible-interior-point algorithm for linear programming
• Polynomiality of infeasible-interior-point algorithms for linear programming
• Unnamed Item

This page was built for publication: A primal-dual infeasible-interior-point algorithm for multiple objective linear programming problems