Pages that link to "Item:Q415371"
From MaRDI portal
The following pages link to Necessary and sufficient constraint qualification for surrogate duality (Q415371):
Displaying 11 items.
- Characterizations of the solution set for non-essentially quasiconvex programming (Q1686559) (← links)
- Duality theorems for quasiconvex programming with a reverse quasiconvex constraint (Q1750686) (← links)
- On generalized surrogate duality in mixed-integer nonlinear programming (Q2118119) (← links)
- Duality theorems for convex and quasiconvex set functions (Q2225642) (← links)
- Optimality condition and quasi-conjugate duality with zero gap in nonconvex optimization (Q2228387) (← links)
- Optimality conditions and constraint qualifications for quasiconvex programming (Q2278888) (← links)
- Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential (Q2351521) (← links)
- Surrogate duality for robust optimization (Q2356091) (← links)
- Duality theorems for separable convex programming without qualifications (Q2359787) (← links)
- Nonlinear error bounds for quasiconvex inequality systems (Q2361132) (← links)
- Characterizations of the solution set for tangentially convex optimization problems (Q6043119) (← links)
