The Attainment of the Solution of the Dual Program in Vertices for Vectorial Linear Programs
Frank Heyde,
Andreas Löhne and
Christiane Tammer ()
Additional contact information
Christiane Tammer: Martin-Luther-University Halle Halle-Wittenberg
A chapter in Multiobjective Programming and Goal Programming, 2009, pp 13-24 from Springer
Abstract:
Abstract This article is a continuation of Löhne A, Tammer C (2007: A new approach to duality in vector optimization. Optimization 56(1–2):221–239) [14]. We developed in [14] a duality theory for convex vector optimization problems, which is different from other approaches in the literature. The main idea is to embed the image space Rq of the objective function into an appropriate complete lattice, which is a subset of the power set of Rq. This leads to a duality theory which is very analogous to that of scalar convex problems. We applied these results to linear problems and showed duality assertions. However, in [14] we could not answer the question, whether the supremum of the dual linear program is attained in vertices of the dual feasible set. We show in this paper that this is, in general, not true but, it is true under additional assumptions.
Keywords: Dual program; Linear programs; Multi-objective optimization; Vertices (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:lnechp:978-3-540-85646-7_2
Ordering information: This item can be ordered from
http://www.springer.com/9783540856467
DOI: 10.1007/978-3-540-85646-7_2
Access Statistics for this chapter
More chapters in Lecture Notes in Economics and Mathematical Systems from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().