Optimality conditions in sub-(b,m)-convex programming

MaRDI QIDQ5090695zbMATH OpenFDO

Authors Jiagen Liao, Tingsong Du

Publication date 20 July 2022

zbMATH Keywords

optimality conditionsmulti-objective programminggeneralized convex functionssub-\((b, m)\)-convex functionsub-\((b, m)\)-convex set

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Convexity of real functions of several variables, generalizations (26B25)

Recommendations

• scientific article; zbMATH DE number 6130022
• On some characterizations of sub-\(b\)-\(s\)-convex functions
• \(B\)-semi-\( (E,F)\)-convex functions and programming
• Optimality conditions for multi-objective fractional programming with a new formulation of generalized convexity
• Optimality and duality with respect to \(b\)-\((\mathcal{E},m)\)-convex programming

Cited in

(2)

• Optimality and duality with respect to \(b\)-\((\mathcal{E},m)\)-convex programming
• On some characterizations of sub-\(b\)-\(s\)-convex functions

This page was built for publication: Optimality conditions in sub-\((b,m)\)-convex programming

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