scientific article

zbMATH Open0643.90063MaRDI QIDQ3786282

Sehun Kim

Publication date: 1985

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Lagrangean relaxationSufficient conditions for a zero duality gap

Mathematics Subject Classification ID

Mixed integer programming (90C11) Duality theory (optimization) (49N15)

Recommendations

• Unnamed Item 👍 👎
• Zero duality gap for convex programs: a generalization of the Clark-Duffin theorem 👍 👎
• On a Lagrangian sufficient optimality condition 👍 👎
• Sufficient conditions and perfect duality in nonconvex minimization with inequality constraints 👍 👎
• Zero duality gap for a class of nonconvex optimization problems 👍 👎
• Constraint qualifications characterizing Lagrangian duality in convex optimization 👍 👎
• Optimality condition and quasi-conjugate duality with zero gap in nonconvex optimization 👍 👎
• Zero duality gap conditions via abstract convexity 👍 👎
• Conditions for zero duality gap in convex programming 👍 👎
• Relaxed Lagrangian duality in convex infinite optimization: reducibility and strong duality 👍 👎

This page was built for publication: