One-constraint optimization problems are approached via Lagrange multipliers. Sequential search schemes for generating suitable trial multiplier values are compared, and it is shown 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, one-pass search procedure based on bisection for a multi-item, multi-echelon inventory problem is also presented. 25 pp. Ref.
This report is part of the RAND Corporation paper series. The paper was a product of the RAND Corporation from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.
The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.