  In a recent paper an Inexact Restoration method for solving continuous
constrained optimization problems was analyzed from the point of view of
worst-case functional complexity and convergence. On the other hand, the
Inexact Restoration methodology was employed, in a different research,to handle
minimization problems with inexact evaluation and simple constraints. These two
methodologies are combined in the present report, for constrained minimization
problems in which both the objective function and the constraints, as well as
their derivatives, are subject to evaluation errors. Together with a complete
description of the method, complexity and convergence results will be proved.
