In this paper, we give necessary optimality conditions for the nonlinear bilevel programming problem. Furthermore, at each feasible point, we show that the steepest descent direction is obtained by solving a quadratic bilevel programming problem. We give indication that this direction can be used to develop a descent algorithm for the nonlinear bilevel problem.