An interior multiobjective primal-dual linear programming algorithm based on approximated gradients and efficient anchoring points
type: Item
instance of: scholarly article
title: An interior multiobjective primal-dual linear programming algorithm based on approximated gradients and efficient anchoring points
zbMATH Open document ID: 0889.90120
DOI: 10.1016/S0305-0548(96)00055-X
author: Ami Arbel
published in: Computers \& Operations Research
publication date: 1997-11-25T00:00:00Z
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 1091584
zbMATH Keywords: multiple objective linear programming
zbMATH Keywords: path-following primal-dual algorithm
MaRDI profile type: Publication
cites work: Q3815146
cites work: Q3716769
cites work: A new polynomial-time algorithm for linear programming
cites work: Q3491304
cites work: Implementation of a Dual Affine Interior Point Algorithm for Linear Programming
cites work: An Implementation of a Primal-Dual Interior Point Method for Linear Programming
cites work: Computational experience with a dual affine variant of Karmarkar's method for linear programming
cites work: A modification of Karmarkar's linear programming algorithm
cites work: An interior multiobjective linear programming algorithm
cites work: Q3044280
cites work: Q4288838
cites work: Anchoring Points and Cones of Opportunities in Interior Multiobjective Linear Programming
description: scientific article; zbMATH DE number 1091584