A multiobjective interior primal-dual linear programming algorithm

DOI10.1016/0305-0548(94)90030-2zbMath0810.90110OpenAlexW2036792480MaRDI QIDQ1318462

Ami Arbel

Publication date: 27 March 1994

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(94)90030-2

zbMATH Keywords

primal-dual interior point algorithmmultiobjective linear programming

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Linear programming (90C05)

Related Items (4)

Solving biobjective network flow problem associated with minimum cost-time loading ⋮ Solving scalarized multi-objective network flow problems using an interior point method ⋮ Partitioning multiple objective optimal solutions with applications in radiotherapy design ⋮ Analytic centers and repelling inequalities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Interior path following primal-dual algorithms. I: Linear programming
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• Representation of visual response to neural firing
• Generating interior search directions for multiobjective linear programming using approximate gradients and efficient anchoring points
• An Implementation of a Primal-Dual Interior Point Method for Linear Programming

This page was built for publication: A multiobjective interior primal-dual linear programming algorithm