A Remark on the Formulation of Dual Programs Based on Generalized Convexity

Diethard Pallaschke
Additional contact information
Diethard Pallaschke: Universität Karlsruhe

A chapter in Perspectives on Operations Research, 2006, pp 93-109 from Springer

Abstract: Abstract In this paper we present a general concept for the formulation of the dual program which is based on generalized convexity. This is done in a purely algebraic way where no topological assumptions are made. Moreover all proofs are presented in an extreme simple way. A complete presentation of this subject can be found in the book of D. Pallaschke and S. Rolewicz [14].

Keywords: Generalized Convexity; Value Function; Lagrange Duality (search for similar items in EconPapers)
Date: 2006
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:sprchp:978-3-8350-9064-4_6

Ordering information: This item can be ordered from
http://www.springer.com/9783835090644

DOI: 10.1007/978-3-8350-9064-4_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().