Invexity and the Kuhn-Tucker Theorem in the Continuous-time Context

In this work we study the relationship between the concept of invexity and the Kuhn-Tucker optimality conditions to the continuous-time nonlinear programming problem . We use duality results to establish these relations. We also show that the invexity concept is a kind of constraint qualification.