Optimization Online


New algorithms for discrete vector optimization based on the Graef-Younes method and cone-monotone sorting functions

Christian GŁnther (Christian.Guenther***at***mathematik.uni-halle.de)
Nicolae Popovici (popovici***at***math.ubbcluj.ro)

Abstract: The well-known Jahn-Graef-Younes algorithm, proposed by Jahn in 2006, generates all minimal elements of a finite set with respect to an ordering cone. It consists of two Graef-Younes procedures, namely the forward iteration, which eliminates a part of the non-minimal elements, followed by the backward iteration, which is applied to the reduced set generated by the previous iteration. Without using the backward iteration, we develop new algorithms that also compute all minimal elements of the initial set, by combining the forward iteration with certain sorting procedures based on cone-monotone functions. In particular, when the ordering cone is polyhedral, computational results obtained in MATLAB allow us to compare our algorithms with the Jahn-Graef-Younes algorithm, within a bi-objective optimization problem.

Keywords: Partially ordered space; Minimal element; Domination property; Graef-Younes reduction method; Cone-monotone function; Multiobjective subdivision technique

Category 1: Other Topics (Multi-Criteria Optimization )

Category 2: Nonlinear Optimization (Constrained Nonlinear Optimization )

Citation: Preprint (June 16, 2017), Martin Luther University Halle-Wittenberg, Faculty of Natural Sciences II, Institute for Mathematics, 06099 Halle (Saale), Germany (submitted)

Download: [PDF]

Entry Submitted: 06/19/2017
Entry Accepted: 06/19/2017
Entry Last Modified: 01/13/2018

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society