Generators and constraint qualifications for quasiconvex inequality systems
From MaRDI portal
Recommendations
- Constraint qualification for quasiconvex inequality system with applications in constraint optimization
- Optimality conditions and the basic constraint qualification for quasiconvex programming
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Optimality conditions and constraint qualifications for quasiconvex programming
- Some constraint qualifications for quasiconvex vector-valued systems
Cited in
(9)- Characterizations of the solution set for non-essentially quasiconvex programming
- Duality theorems for quasiconvex programming with a reverse quasiconvex constraint
- Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- Duality theorems for convex and quasiconvex set functions
- Optimality conditions and constraint qualifications for quasiconvex programming
- Nonlinear error bounds for quasiconvex inequality systems
- Strong and total Lagrange dualities for quasiconvex programming
- Optimality conditions and the basic constraint qualification for quasiconvex programming
- Characterizations of approximate solution and approximate duality for quasiconvex programming
This page was built for publication: Generators and constraint qualifications for quasiconvex inequality systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4640015)
