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 algorithm.
@article{urn:eudml:doc:39983,
title = {Zero or near-to-zero Lagrange multipliers in linearly constrained nonlinear programming.},
journal = {Q\"uestii\'o},
volume = {6},
year = {1982},
pages = {193-204},
language = {en},
url = {http://dml.mathdoc.fr/item/urn:eudml:doc:39983}
}
Escudero, Laureano F. Zero or near-to-zero Lagrange multipliers in linearly constrained nonlinear programming.. Qüestiió, Tome 6 (1982) pp. 193-204. http://gdmltest.u-ga.fr/item/urn:eudml:doc:39983/