On the relations between different duals assigned to composed optimization problems

Gert Wanka (), Radu Boţ () and Emese Vargyas ()

Mathematical Methods of Operations Research, 2007, vol. 66, issue 1, 47-68

Abstract: For an optimization problem with a composed objective function and composed constraint functions we determine, by means of the conjugacy approach based on the perturbation theory, some dual problems to it. The relations between the optimal objective values of these duals are studied. Moreover, sufficient conditions are given in order to achieve equality between the optimal objective values of the duals and strong duality between the primal and the dual problems, respectively. Finally, some special cases of this problem are presented. Copyright Springer-Verlag 2007

Keywords: Convex programming; Conjugate duality; Perturbation theory; Composed functions; 49N15; 52A41; 90C25 (search for similar items in EconPapers)
Date: 2007
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1007/s00186-007-0169-6 (text/html)
Access to full text is restricted to subscribers.

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:mathme:v:66:y:2007:i:1:p:47-68

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s00186-007-0169-6

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().