scientific article; zbMATH DE number 1139561

<a class="pub-badge pub-badge--grey" href="https://zbmath.org/0896.90163" rel="nofollow">zbMATH</a><a class="pub-badge pub-badge--mardi" href="https://portal.mardi4nfdi.de/wiki/Item:Q4384871" rel="nofollow">MaRDI QID Q4384871</a><a class="pub-badge pub-badge--grey" href="https://fdo.portal.mardi4nfdi.de/fdo/Q4384871" rel="nofollow">FDO</a>

Authors Tibor Illés, Gábor Kassay

Publication date 13 April 1998

zbMATH Keywords

constrained optimizationFarkas lemmaLagrangian duality theoremcone-convexlike hypotheses

Mathematics Subject Classification ID

Nonlinear programming (90C30) Duality theory (optimization) (49N15)

Recommendations

• Perfect duality in semi-infinite and semidefinite programming
• A unified approach to duality in convex programming
• Duality for almost convex optimization problems via the perturbation approach
• scientific article; zbMATH DE number 1552283
• Duality and Convex Programming
• Duality and Convex Programming
• Publication:4937595
• scientific article; zbMATH DE number 5726470
• scientific article; zbMATH DE number 3856832
• Duality for inexact linear programming problems^∗

Cited in

(2)

• Theorems of the alternative and optimality conditions for convexlike and general convexlike programming
• Perfect duality in semi-infinite and semidefinite programming

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 Q4384871)