OPTIMIZATION PROBLEMS WITH ONE CONSTRAINT,
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)
Document Details
- Document Type
- Technical Report
- Publication Date
- Oct 01, 1968
- Accession Number
- AD0676975
Entities
People
- B. L. Fox
- D. M. Landi
Organizations
- RAND Corporation