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 ...
geometry: A linear matrix inequality A(x) > 0 is infeasible if and only if -1 lies in the quadratic module associated to A. We also present a new exact duality theory for semidefinite programming, ...
Perold, André, and R. Meidan. "Optimality Conditions and Strong Duality in Abstract and Continuous Time Linear Programming." Journal of Optimization Theory and Applications 40, no. 1 (May 1983): 61–76 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback