6533b7d9fe1ef96bd126cb28

RESEARCH PRODUCT

Farkas-Minkowski systems in semi-infinite programming

J. PastorMarco A. LópezMiguel A. Goberna

subject

Discrete mathematicsPure mathematicsNonlinear systemControl and OptimizationApplied MathematicsMinkowski spaceSecond-order cone programmingDuality (optimization)Constraint satisfactionSemi-infinite programmingMathematics

description

The Farkas-Minkowski systems are characterized through a convex cone associated to the system, and some sufficient conditions are given that guarantee the mentioned property. The role of such systems in semi-infinite programming is studied in the linear case by means of the duality, and, in the nonlinear case, in connection with optimality conditions. In the last case the property appears as a constraint qualification.

https://doi.org/10.1007/bf01442122