An interior multiobjective primal-dual linear programming algorithm using approximated gradients and sequential generation of anchor points

DOI10.1080/02331939408843979zbMath0818.90097OpenAlexW2065120047MaRDI QIDQ4764862

Ami Arbel

Publication date: 20 April 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939408843979

zbMATH Keywords

multiple objective linear programmingpath-following primal-dual algorithm

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Linear programming (90C05) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items (2)

A weighted-gradient approach to multi-objective linear programming problems using the analytic hierarchy process ⋮ An interactive interior point algorithm for multiobjective linear programming problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A modification of Karmarkar's linear programming algorithm
• A new polynomial-time algorithm for linear programming
• How to handle dependence with the analytic hierarchy process
• An Interactive Approach for Multi-Criterion Optimization, with an Application to the Operation of an Academic Department

This page was built for publication: An interior multiobjective primal-dual linear programming algorithm using approximated gradients and sequential generation of anchor points