Strong duality of the general capacity problem in metric spaces

J. Rigoberto Gabriel and Onésimo Hernández-Lerma

Mathematical Methods of Operations Research, 2001, vol. 53, issue 1, 25-34

Abstract: This paper concerns the general capacity (GC) problem on metric spaces. Conditions are given under which the strong duality condition holds, that is, GC and its dual GC * are both solvable and their optimal values coincide. Copyright Springer-Verlag Berlin Heidelberg 2001

Keywords: Key words: General capacity problem; infinite linear programming; strong duality; Subject Classifications. 90C08; 90C48 (search for similar items in EconPapers)
Date: 2001
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1007/s001860000078 (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:53:y:2001:i:1:p:25-34

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

DOI: 10.1007/s001860000078

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 ().