A difference of convex and polyhedral convex functions programming problem

zbMATH Open1440.90053MaRDI QIDQ5117520FDOQ5117520

Authors: Satoshi Suzuki, Daishi Kuroiwa, Yusuke Saeki 

Publication date: 25 August 2020

Recommendations

• A necessary and sufficient constraint qualification for DC programming problems with convex inequality constraints
• Optimality conditions in DC-constrained mathematical programming problems
• Optimality conditions for DC programming problems with reverse convex constraints
• Qualification and optimality conditions for dc programs with infinite constraints
• DC programming: overview.

zbMATH Keywords

fractional programmingbasic constraint qualificationdifference of convex and polyhedral convex functions programming

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26)

Cited In (3)

• Local programming.
• Necessary conditions for local optimality in difference-of-convex programming
• Optimality conditions in DC-constrained mathematical programming problems

This page was built for publication: A difference of convex and polyhedral convex functions programming problem

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