Asymptotic optimality conditions for linear semi-infinite programming
From MaRDI portal
Recommendations
- An optimality test for semi-infinite linear programming
- Conditions for the uniqueness of the optimal solution in linear semi- infinite programming
- Optimality theory for semi-infinite linear programming∗
- Necessary optimality conditions in semi-infinite linear programming: constraint qualifications and properties of the feasible set
- Optimality conditions for semi-infinite programming problems involving generalized convexity
Cites work
- A ladder method for linear semi-infinite programming
- An alternative formulation for a new closed cone constraint qualification
- An exterior point linear programming method based on inclusive normal cones
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization
- Duality in linear programming: from trichotomy to quadrichotomy
- Extended Active Constraints in Linear Optimization with Applications
- Locally Farkas-Minkowski linear inequality systems
- Locally Farkas-Minkowski systems in convex semi-infinite programming
- New Farkas-type constraint qualifications in convex infinite programming
- On Constraint Qualification for an Infinite System of Convex Inequalities in a Banach Space
- Optimal control problems with unbounded constraint sets
- Perfect duality in semi-infinite and semidefinite programming
- Quasi-Slater and Farkas-Minkowski qualifications for semi-infinite programming with applications
- Semi-infinite programming
- Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers
- Uncertainty modelling and robust output feedback control of nonlinear discrete systems: a mathematical programming approach
- {\(\Gamma\)}-active constraints in convex semi-infinite programming
Cited in
(10)- Recent contributions to linear semi-infinite optimization
- Recent contributions to linear semi-infinite optimization: an update
- Optimality conditions for semi-infinite programming problems involving generalized convexity
- Asymptotic approximation method and its convergence on semi-infinite programming
- New constraint qualification and optimality for linear semi-infinite programming
- Post-Optimal Analysis in Linear Semi-Infinite Optimization
- An optimality test for semi-infinite linear programming
- Moreau-Rockafellar-type formulas for the subdifferential of the supremum function
- Optimality theory for semi-infinite linear programming∗
- Necessary optimality conditions in semi-infinite linear programming: constraint qualifications and properties of the feasible set
This page was built for publication: Asymptotic optimality conditions for linear semi-infinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2790886)
