An interior multiobjective primal-dual linear programming algorithm based on approximated gradients and efficient anchoring points

DOI10.1016/S0305-0548(96)00055-XMaRDI QIDQ1373875zbMATH OpenFDO

Authors Ami Arbel

Publication date 25 November 1997

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

zbMATH Keywords

multiple objective linear programmingpath-following primal-dual algorithm

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Recommendations

• An interior multiobjective primal-dual linear programming algorithm using approximated gradients and sequential generation of anchor points
• Generating interior search directions for multiobjective linear programming using approximate gradients and efficient anchoring points
• Generating interior search directions for multiobjective linear programming
• An Interior Multiple Objective Primal-dual Linear Programming Algorithm Using Efficient Anchoring Points

Cites work

• scientific article; zbMATH DE number 2086188 (Why is no real title available?)
• scientific article; zbMATH DE number 4164543 (Why is no real title available?)
• scientific article; zbMATH DE number 3945836 (Why is no real title available?)
• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• scientific article; zbMATH DE number 556044 (Why is no real title available?)
• A modification of Karmarkar's linear programming algorithm
• A new polynomial-time algorithm for linear programming
• An Implementation of a Primal-Dual Interior Point Method for Linear Programming
• An interior multiobjective linear programming algorithm
• Anchoring Points and Cones of Opportunities in Interior Multiobjective Linear Programming
• Computational experience with a dual affine variant of Karmarkar's method for linear programming
• Implementation of a Dual Affine Interior Point Algorithm for Linear Programming

Cited in

(10)

• An Interior Multiple Objective Primal-dual Linear Programming Algorithm Using Efficient Anchoring Points
• Solving scalarized multi-objective network flow problems using an interior point method
• Using Efficient Anchoring Points for Generating Search Directions in Interior Multiobjective Linear Programming
• scientific article; zbMATH DE number 597811 (Why is no real title available?)
• An interior multiobjective primal-dual linear programming algorithm using approximated gradients and sequential generation of anchor points
• An interior-point approach for solving MC\(^2\) linear programming problems
• A primal-dual infeasible-interior-point algorithm for multiple objective linear programming problems
• A primal-dual infeasible-interior-point algorithm for multiple objective linear programming problems
• Primal-dual simplex method for multiobjective linear programming
• A weighted-gradient approach to multi-objective linear programming problems using the analytic hierarchy process

This page was built for publication: An interior multiobjective primal-dual linear programming algorithm based on approximated gradients and efficient anchoring points

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