Duality theorems of a nonconvex program with infinite constraints

zbMATH Open1440.90052MaRDI QIDQ5117546FDOQ5117546

Authors: Pham Ngoc Nam, Do Sang Kim, T. Q. Son 

Publication date: 25 August 2020

Recommendations

• Refinements of \(\varepsilon\)-duality theorems for a nonconvex problem with an infinite number of constraints
• \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
• Duality and infinite dimensional optimization
• Duality theorems for a nonconvex set-valued optimization problem
• scientific article; zbMATH DE number 3920221

zbMATH Keywords

Mond-Weir type dualityWolfe type dualityLagrange type dualitysaddle points theorem

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Semi-infinite programming (90C34) Duality theory (optimization) (49N15)

Cited In (8)

• Duality theorems for a nonconvex set-valued optimization problem
• Duality in Countably Infinite Monotropic Programs
• Refinements of \(\varepsilon\)-duality theorems for a nonconvex problem with an infinite number of constraints
• Title not available (Why is that?)
• Title not available (Why is that?)
• \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
• Weak stability and strong duality of a class of nonconvex infinite programs via augmented Lagrangian
• Title not available (Why is that?)

This page was built for publication: Duality theorems of a nonconvex program with infinite constraints

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