Skip to main content
SpringerLink
Log in

Uniform LP duality for semidefinite and semi-infinite programming

  • Original Paper
  • Published:
Central European Journal of Operations Research Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Charnes A, Cooper WW and Kortanek KO (1962). Duality, Haar programs and finite sequence spaces. US Proc Natl Acad Sci 48: 782–786

    Google Scholar 

  • Charnes A, Cooper WW and Kortanek KO (1963). Duality in semi-infinite programs and some works of Haar and Carathéodory. Manage Sci 9: 208–228

    Google Scholar 

  • Charnes A, Cooper WW and Kortanek KO (1965). On representation of semi-infinite programs which have no duality gaps. Manage Sci 12: 113–121

    Article  Google Scholar 

  • Duffin RJ and Karlovitz LA (1965). An infinite linear program with a duality gap. Manage Sci 12: 122–134

    Google Scholar 

  • Duffin RJ, Jeroslow RG, Karlovitz LA (1983) Duality in semi-infinite programming. In: Fiacco AV, Kortanek KO (eds) Extremal methods and systems analysis. Lecture notes in economics and mathematical systems, vol 174. Springer, New York, pp 50–62

  • Goberna MA and López MA (1998). Linear semi-infinite optimization. Wiley, New York

    Google Scholar 

  • Haar A (1924). Über lineare Ungleichungen. Acta Universitatis Szegedienis 2: 1–14

    Google Scholar 

  • Hettich R and Kortanek KO (1993). Semi-infinite programming: theory, methods and applications. SIAM Rev 35: 380–429

    Article  Google Scholar 

  • Kortanek KO and Zhang Q (2001). Perfect duality in semi-infinite programming and semidefinite programming. Math Program Ser A 91: 127–144

    Google Scholar 

  • Li SJ, Yang XQ and Teo KL (2003). Duality for semi-definite and semi-infinite programming. Optimization 52: 507–528

    Article  Google Scholar 

  • Rockafellar RT (1970). Convex analysis. Princeton University Press, Princeton

    Google Scholar 

  • Todd MJ (2001). Semidefinite optimization. Acta Numerica 10: 515–560

    Google Scholar 

  • Vandenberghe L and Boyd S (1996). Semidefinite programming. SIAM Rev 38: 49–95

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Northern Michigan University, Marquette, MI, 49855, USA

    Qinghong Zhang

Authors
  1. Qinghong Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Qinghong Zhang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, Q. Uniform LP duality for semidefinite and semi-infinite programming. cent.eur.j.oper.res. 16, 205–213 (2008). https://doi.org/10.1007/s10100-007-0048-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10100-007-0048-5

Keywords

Search

Navigation