The nonlinear fractional programming problem is considered. The functi
ons involved in the objective function and constraints are assumed to
be invex and differentiable. It is shown that the ratio of invex funct
ions is invex. Sufficient optimality and duality theorems art: present
ed for an invex fractional programming problem. (C) 1997 Academic Pres
s.