A General Class of Convexification Transformation for the Noninferior Frontier of a Multiobjective Program

A general class of convexification transformations is proposed to convexify the noninferior frontier of a multiobjective program. We prove that under certain assumptions the noninferior frontier could be convexified completely or partly after transformation and then weighting method can be applied t...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:American journal of operations research 2013-05, Vol.3 (3), p.387-392
Hauptverfasser: Li, Tao, Wang, Yanjun, Liang, Zhian
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A general class of convexification transformations is proposed to convexify the noninferior frontier of a multiobjective program. We prove that under certain assumptions the noninferior frontier could be convexified completely or partly after transformation and then weighting method can be applied to identify the noninferior solutions. Numerical experiments are given to vindicate our results.
ISSN:2160-8830
2160-8849
DOI:10.4236/ajor.2013.33036