scientific article; zbMATH DE number 4049394

zbMATH Open0643.90063MaRDI QIDQ3786282FDOQ3786282

Sehun Kim

Publication date: 1985

Title of this publication is not available (Why is that?)

Recommendations

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

zbMATH Keywords

Lagrangean relaxationSufficient conditions for a zero duality gap

Mathematics Subject Classification ID

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

Cited In (1)

• Lagrangean duality for facial programs with applications to integer and complementarity problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3786282)