Accession Number : AD0676975

Title :   OPTIMIZATION PROBLEMS WITH ONE CONSTRAINT,

Corporate Author : RAND CORP SANTA MONICA CALIF

Personal Author(s) : Fox,B. L. ; Landi,D. M.

Report Date : OCT 1968

Pagination or Media Count : 31

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)

Descriptors :   (*AIR FORCE EQUIPMENT, INVENTORY CONTROL), (*INVENTORY CONTROL, LINEAR PROGRAMMING), OPTIMIZATION, COMPUTER PROGRAMMING, NUMERICAL ANALYSIS, PARTIAL DIFFERENTIAL EQUATIONS, MINIMAX TECHNIQUE, MAINTENANCE

Subject Categories : Logistics, Military Facilities and Supplies

Distribution Statement : APPROVED FOR PUBLIC RELEASE