Using aspiration levels in an interior primal-dual multiobjective linear programming algorithm

Ami Arbel, Pekka Korhonen

Research output: Contribution to journalArticlepeer-review


We introduce in this paper a new multiple-objective linear programming (MOLP) algorithm. The algorithm is based on the single-objective path-following primal-dual linear programming algorithm and combines it with aspiration levels and the use of achievement scalarizing functions. The resulting algorithm falls in the class of interactive MOLP algorithms, as it requires interaction with the decision maker (DM) during the iterative process to obtain statements of aspirations for levels of objectives of the MOLP problem. The interior point algorithm is then used to trace a path of interates from a current (interior) solution and approach as closely as desired a non-dominated solution corresponding to the optimum of the achievement scalarizing function. The timing of the interaction with the DM is dependent on the progress of the interior algorithm. It can take place every few, pre-specified, iterations or after the duality gap achieved for the stated aspirations has fallen below a certain threshold. It is expected that an interior algorithm will speed up the overall process of searching and finding the most preferred MOLP solution-especially in large-scale problems-by avoiding the need for numerous pivot operations and their corresponding interactive sessions inherent in simplex-based algorithms.

Original languageEnglish
Pages (from-to)61-71
Number of pages11
JournalJournal of Multi-Criteria Decision Analysis
Issue number1
StatePublished - Mar 1996


  • Aspiration levels
  • Interior point algorithms
  • Multiple-objective linear programming
  • Path-following primal-dual algorithm
  • Scalarizing functions


Dive into the research topics of 'Using aspiration levels in an interior primal-dual multiobjective linear programming algorithm'. Together they form a unique fingerprint.

Cite this