On Linear and Linearized Generalized Semi-Infinite Optimization Problems

Jan-J. Rückmann () and Oliver Stein ()

Annals of Operations Research, 2001, vol. 101, issue 1, 208 pages

Abstract: We consider the local and global topological structure of the feasible set M of a generalized semi-infinite optimization problem. Under the assumption that the defining functions for M are affine-linear with respect to the index variable and separable with respect to the index and the state variable, M can globally be written as the finite union of certain open and closed sets. Here, it is not necessary to impose any kind of constraint qualification on the lower level problem. In fact, these sets are level sets of the lower level Lagrangian, and the open sets are generated exactly by Lagrange multiplier vectors with vanishing entry corresponding to the lower level objective function. This result gives rise to a first order necessary optimality condition for the considered generalized semi-infinite problem. Finally it is shown that the description of M by open and closed level sets of the lower level Lagrangian locally carries over to points of the so-called mai-type, where neither the linearity nor the separability assumption is satisfied. Copyright Kluwer Academic Publishers 2001

Keywords: generalized semi-infinite optimization; optimality condition; linearized problem; duality; disjunctive optimization; mai-point; level set (search for similar items in EconPapers)
Date: 2001
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1010972524021 (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:101:y:2001:i:1:p:191-208:10.1023/a:1010972524021

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

DOI: 10.1023/A:1010972524021

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