Linear semi-infinite programming (LSIP) is a branch of optimisation that focuses on problems where a finite number of decision variables is subject to infinitely many linear constraints. This ...
Recall that a constraint qualification is a property of feasible points of the constrained optimization problem that, when satisfied by a local minimizer, implies that such a minimizer satisfies KKT.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results