A multiobjective interior primal-dual linear programming algorithm

Ami Arbel*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


This paper presents an interior Multiobjective Linear Programming (MOLP) algorithm that is based on a variant of Karmarkar's interior-point algorithm known as the path-following primal-dual algorithm. The modification is accomplished by combining the single step direction vectors generated by the single-objective algorithm into a combined vector along which we step from the current iterate to the next iterate. Combining step direction vectors into a single step can be done by either approximating the gradient of an implicit utility function at the current iterate, or by creating convex combinations of single directions. We discuss both approaches and use the latter to develop an interior algorithm directed at handling MOLP problems. We refer to the resulting class of MOLP algorithms resulting from this variant as Primal-Dual Interior Multiobjective Linear Programming (PDIMOLP) algorithm.

Original languageEnglish
Pages (from-to)433-445
Number of pages13
JournalComputers and Operations Research
Issue number4
StatePublished - Apr 1994


Dive into the research topics of 'A multiobjective interior primal-dual linear programming algorithm'. Together they form a unique fingerprint.

Cite this