Optimality conditions and duality of three kinds of nonlinear fractional programming problems (Q2248697): Difference between revisions

Summary: Some assumptions for the objective functions and constraint functions are given under the conditions of convex and generalized convex, which are based on the \(F\)-convex, \(\rho\)-convex, and \((f,\rho)\)-convex. The sufficiency of Kuhn-Tucker optimality conditions and appropriate duality results are proved involving \((F,\rho)\)-convex, \((F,\alpha,\rho,d)\)-convex, and generalized \((F,\alpha,\rho,d)\)-convex functions.