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 ...
