Roughly \(B\)-invex programming problems

DOI10.1007/s10092-010-0034-5zbMath1242.90162OpenAlexW1992287959MaRDI QIDQ543489

Tarek G. Emam

Publication date: 17 June 2011

Published in: Calcolo (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10092-010-0034-5

zbMATH Keywords

generalized convexitydualityoptimalityconvex setsconvex functions

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29) Interior-point methods (90C51)

Related Items (4)

Optimality for \(E\text{-}[0,1\) convex multi-objective programming problems] ⋮ Constrained controlled optimization problems involving second-order derivatives ⋮ Optimality for E-[0,1 convex multi-objective programming] ⋮ Optimality and duality with respect to \(b\)-\((\mathcal{E},m)\)-convex programming

Cites Work

• Unnamed Item
• Explicitly \(B\)-preinvex functions
• Optimality criteria in nonlinear programming involving nonconvex functions
• Invexity and optimization
• Generalized convexity and vector optimization
• On sufficiency of the Kuhn-Tucker conditions
• B-vex functions
• Generalized B-vex functions and generalized B-vex programming
• Six kinds of roughly convex functions
• Explicitly B-preinvex fuzzy mappings
• Generalised convexity and duality in multiple objective programming
• Generalization of some duality theorems in nonlinear programming

This page was built for publication: Roughly \(B\)-invex programming problems