OPTIMIZATION PROBLEMS WITH ONE CONSTRAINT
Bennett L. Fox, Dale M. Landi · 1968
Abstract : One-constraint optimization problems are approached via Lagrange multipliers. This memorandum compares sequential search schemes for generating suitable trial multiplier values, and shows that, in general, the minimax sequential search is bisection. For certain applications, it pays to design search procedures that take advantage of special structure, such as recursively defined functions. An efficient search procedure based on bisection for a multi-item, multi-echelon inventory example is also presented. (Author)