First order optimality conditions for generalized semi-infinite programming problems (Q946193): Difference between revisions

The authors extend the well-known constraint qualifications for finite programming problems such as the calmness condition, the Abadie constraint qualification, the Kuhn-Tucker constraint qualification, the Salter condition, the linear independence constraint qualification to Generalized Semi-Infinite Programming Problems. They analize the extent to which a corresponding Karush-Kuhn-Tucker condition depends on these extensions. Relationships among the new and the existing constraint qualifications are also given. One of the purposes of the paper is to remove the uniform boundedness assumption on the set valued map corresponding to the index set depending on the decision variable.