Using a projective approach, new necessary conditions and new sufficient conditions for optimization problems with explicit or implicit constraints are examined. They are compared to previous ones. A particular emphasis is given to mathematical programming problems with non-polyhedral constraints. This case occurs in particular when the constraints are defined in functional spaces.