On ratio invexity in mathematical programming

[摘要] The nonlinear fractional programming problem is considered. The functions involved in the objective function and constraints are assumed to be invex and differentiable. It is shown that the ratio of invex functions is invex. Sufficient optimality and duality theorems art: presented for an invex fractional programming problem. (C) 1997 Academic Press.

[发布日期] 1997-01-15