A Dual Parametrization Method for Convex Semi-Infinite Programming

S. Ito (), Y. Liu () and K.L. Teo ()

Annals of Operations Research, 2000, vol. 98, issue 1, 189-213

Abstract: We formulate convex semi-infinite programming problems in a functional analytic setting and derive optimality conditions and several duality results, based on which we develop a computational framework for solving convex semi-infinite programs. Copyright Kluwer Academic Publishers 2000

Keywords: semi-infinite programming; convex programming; optimality condition; duality; converse duality; quadratic semi-infinite programming; linear semi-infinite programming (search for similar items in EconPapers)
Date: 2000
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1019208524259 (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:annopr:v:98:y:2000:i:1:p:189-213:10.1023/a:1019208524259

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

DOI: 10.1023/A:1019208524259

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().