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

DOI10.1007/BF02830664zbMath1099.90057MaRDI QIDQ5892655

Yuan Yuan, Hui Huang, Pusheng Fei

Publication date: 2005

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

zbMATH Keywords

primal-dualmultiple objective linear programminginfeasible-interior-point algorithm

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Interior-point methods (90C51)

Cites Work

• Unnamed Item
• 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

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