Steepest ascent algorithms for nonconical multiple objective programming

Gordon B. Hazen*, Thomas L. Morin

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

A steepest ascent family of algorithms suitable for the direct solution of continuous variable unconstrained nonconical multiple objective programming problems is introduced. Nonconical multiple objective problems, unlike standard (conical) vector optimization problems, cannot be easily solved by examining related single objective problems. The concept of a direction of steepest ascent is generalized to the multiple objective context and the question of algorithmic convergence is treated. A computational example involving a nonconical unanimity order is given.

Original languageEnglish (US)
Pages (from-to)188-221
Number of pages34
JournalJournal of Mathematical Analysis and Applications
Volume100
Issue number1
DOIs
StatePublished - Apr 30 1984

ASJC Scopus subject areas

  • Analysis
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Steepest ascent algorithms for nonconical multiple objective programming'. Together they form a unique fingerprint.

Cite this