Uniform LP duality for semidefinite and semi-infinite programming
Recently, a semidefinite and semi-infinite linear programming problem (SDSIP), its dual (DSDSIP), and uniform LP duality between (SDSIP) and (DSDSIP) were proposed and studied by Li et al. (Optimization 52:507–528, 2003). In this paper, we show that (SDSIP) is an ordinary linear semi-infinite program and, therefore, all the existing results regarding duality and uniform LP duality for linear semi-infinite programs can be applied to (SDSIP). By this approach, the main results of Li et al. (Optimization 52:507–528, 2003) can be obtained easily. Copyright Springer-Verlag 2008
Volume (Year): 16 (2008)
Issue (Month): 2 (June)
|Contact details of provider:|| Web page: http://www.springer.com|
Web page: http://www.fhi.sk/ssov
Web page: http://www.mot.org.hu/index_en.html
Web page: http://nb.vse.cz/csov/english.htm
Web page: http://www.oegor.at/
Web page: http://hdoi.hr/en_US/en/
|Order Information:||Web: http://www.springer.com/business/operations+research/journal/10100|
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- A. Charnes & W. W. Cooper & K. Kortanek, 1963. "Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory," Management Science, INFORMS, vol. 9(2), pages 209-228, January.
- R. J. Duffin & L. A. Karlovitz, 1965. "An Infinite Linear Program with a Duality Gap," Management Science, INFORMS, vol. 12(1), pages 122-134, September.
When requesting a correction, please mention this item's handle: RePEc:spr:cejnor:v:16:y:2008:i:2:p:205-213. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Rebekah McClure)
If references are entirely missing, you can add them using this form.