arrow
Return

On linear and linearized generalized semi-infinite optimization problems

delete2001-01-01
delete15
PRE
AI
J
Jan-J. Rückmann *
O
Oliver Stein
DOI:10.1023/A:1010972524021delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
We consider the local and global topological structure of the feasible set M of a generalized semiinfinite 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.
Keywords:
generalized semi-infinite optimization
optimality condition
linearized problem
duality
disjunctive optimization
mai-point
level set
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Annals of Operations Research cover
Annals of Operations Research
IF:
4.5
Papers:
8.1K
Citations:
2.1W

Organization

No organization information available
Cited Papers

Cited Papers

No cited papers available