New constraint qualification and optimality for linear semi-infinite programming
From MaRDI portal
Recommendations
- Necessary optimality conditions in semi-infinite linear programming: constraint qualifications and properties of the feasible set
- Constraint qualifications in linear vector semi-infinite optimization
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
- scientific article; zbMATH DE number 2158983
- Asymptotic optimality conditions for linear semi-infinite programming
Cited in
(11)- Unicity results for general linear semi-infinite optimization problems using a new concept of active constraints
- Recent contributions to linear semi-infinite optimization
- Recent contributions to linear semi-infinite optimization: an update
- Locally Farkas-Minkowski systems in convex semi-infinite programming
- Extension of the LP-Newton method to conic programming problems via semi-infinite representation
- Note on ``A new equivalent transformation for interval inequality constraints of interval linear programming
- Understanding linear semi-infinite programming via linear programming over cones
- scientific article; zbMATH DE number 7293696 (Why is no real title available?)
- Subdifferentials of marginal functions in semi-infinite programming
- scientific article; zbMATH DE number 2158983 (Why is no real title available?)
- New Farkas-type constraint qualifications in convex infinite programming
This page was built for publication: New constraint qualification and optimality for linear semi-infinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2813605)
