About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
Optimization with an approximate Lagrangian
Abstract
An error analysis is provided for discrete Lagrangian cell problems where the exact objective function for each cell is approximated by a simpler expression. Easily-calculated rigorous and heuristic bounds are given for the error in the value of the objective function. The solution itself, however, can be significantly distorted. © 1974 The Mathematical Programming Society.