Generating interior search directions for multiobjective linear programming

Ami Arbel*, Shmuel S. Oren

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

A new multiobjective linear programming (MOLP) algorithm is presented. The algorithm uses a variant of Karmarkar's interior‐point algorithm known as the affine‐scaling primal algorithm. Using this single‐objective algorithm, interior search directions are generated and used to provide an approximation to the gradient of the (implicitly known) utility function. The approximation is guided by assessing locally relevant preference information for the various interior directions through interaction with a decision maker (DM). The resulting algorithm is an interactive approach that makes its progress towards the solution through the interior of the constraints polytope.

Original languageEnglish
Pages (from-to)73-86
Number of pages14
JournalJournal of Multi-Criteria Decision Analysis
Volume2
Issue number2
DOIs
StatePublished - Aug 1993

Keywords

  • Affine‐scaling primal algorithm
  • Interactive methods
  • Interior‐point algorithms
  • Multicriteria decision making (MCDM)
  • Multiobjective linear programming (MOLP)

Fingerprint

Dive into the research topics of 'Generating interior search directions for multiobjective linear programming'. Together they form a unique fingerprint.

Cite this