Zero or near-to-zero Lagrange multipliers in linearly constrained nonlinear programming

Abstract

We discuss in this work the using of Lagrange multipliers estimates in linearly constrained nonlinear programming algorithms and the implication of zero or near-to-zero Lagrange multipliers. Some methods for estimating the tendency of the multipliers are proposed in the context of a given algorith