A new class of convex functions, namely, (b,F)-convex functions, is introduced. Sufficient optimality conditions and duality results are established for nonlinear programming problems under (b,F)-convexity assumptions on the functions involved. Further, we extend these results to fractional programming problems.
