First order necessary conditions and duality results for general inexact nonlinear programming problems formulated in nonreflexive spaces are obtained. The Dubovitskii-Milyutin approach is the main tool used. Particular cases of linear and convex programs are also analyzed and some comments about a comparison of the obtained results with those existing in the literature are given.