Pages that link to "Item:Q2336429"
From MaRDI portal
The following pages link to Strong and total Lagrange dualities for quasiconvex programming (Q2336429):
Displaying 12 items.
- A sharp Lagrange multiplier theorem for nonlinear programs (Q300758) (← links)
- Nonlinear programming via König's maximum theorem (Q328441) (← links)
- Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap (Q1685581) (← links)
- Characterizations of the solution set for non-essentially quasiconvex programming (Q1686559) (← links)
- Revisiting the Hahn-Banach theorem and nonlinear infinite programming (Q2014078) (← links)
- Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints (Q2178343) (← links)
- Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential (Q2351521) (← links)
- Quadratic problems with two quadratic constraints: convex quadratic relaxation and strong lagrangian duality (Q5002413) (← links)
- Strong and total Lagrange dualities for quasiconvex programming (Q5088817) (← links)
- Characterizations of the solution set for tangentially convex optimization problems (Q6043119) (← links)
- (Q6052893) (← links)
- On constraint qualifications for an infinite system of quasiconvex inequalities (Q6494316) (← links)