A multiobjective interior primal-dual linear programming algorithm
type: Item
instance of: scholarly article
title: A multiobjective interior primal-dual linear programming algorithm
zbMATH Open document ID: 0810.90110
DOI: 10.1016/0305-0548(94)90030-2
author: Ami Arbel
published in: Computers \& Operations Research
publication date: 1994-03-27T00:00:00Z
review text: An extension is given of the primal-dual interior point algorithm for linear programming created by \textit{K. A. McShane}, \textit{C. L. Monma} and \textit{D. Shanno} [ORSA J. Comput. 1, No. 2, 70-83 (1989; Zbl 0752.90047)], and other authors. This generalization is directed to the solution of multiobjective linear programming problems including an implicitly-known utility function given by the decision maker such that one point of the efficient solution set will be terminated. Some numerical results are presented.
reviewed by: R.Nehse
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 540544
zbMATH Keywords: primal-dual interior point algorithm
zbMATH Keywords: multiobjective linear programming
MaRDI profile type: Publication
full work available at URL: 0305-0548(94)90030-2
OpenAlex ID: W2036792480
cites work: A new polynomial-time algorithm for linear programming
cites work: Generating interior search directions for multiobjective linear programming using approximate gradients and efficient anchoring points
cites work: Q3491304
cites work: An Implementation of a Primal-Dual Interior Point Method for Linear Programming
cites work: Interior path following primal-dual algorithms. I: Linear programming
cites work: Interior path following primal-dual algorithms. II: Convex quadratic programming
cites work: Q3039055
cites work: Q3815146
cites work: Q3716769
cites work: Q3044280
cites work: Representation of visual response to neural firing
description: scientific article; zbMATH DE number 540544